mathlib documentation

core / init.classical

axiom classical.choice {α : Sort u} :

nonempty α → α

noncomputable def classical.indefinite_description {α : Sort u} (p : α → Prop) (h : ∃ (x : α), p x) :

{x // p x}

Equations

classical.indefinite_description p h = classical.choice _
_ = _

noncomputable def classical.some {α : Sort u} {p : α → Prop} (h : ∃ (x : α), p x) :

α

Equations

classical.some h = (classical.indefinite_description p h).val

theorem classical.some_spec {α : Sort u} {p : α → Prop} (h : ∃ (x : α), p x) :

p (classical.some h)

theorem classical.em (p : Prop) :

theorem classical.exists_true_of_nonempty {α : Sort u} :

nonempty α → (∃ (x : α), true)

noncomputable def classical.inhabited_of_nonempty {α : Sort u} (h : nonempty α) :

Equations

classical.inhabited_of_nonempty h = {default := classical.choice h}

noncomputable def classical.inhabited_of_exists {α : Sort u} {p : α → Prop} (h : ∃ (x : α), p x) :

Equations

classical.inhabited_of_exists h = classical.inhabited_of_nonempty _

@[instance]

noncomputable def classical.prop_decidable (a : Prop) :

Equations

classical.prop_decidable a = classical.choice _

noncomputable def classical.decidable_inhabited (a : Prop) :

inhabited (decidable a)

Equations

classical.decidable_inhabited a = {default := classical.prop_decidable a}

noncomputable def classical.type_decidable_eq (α : Sort u) :

decidable_eq α

Equations

classical.type_decidable_eq α = λ (x y : α), classical.prop_decidable (x = y)

noncomputable def classical.type_decidable (α : Sort u) :

psum α (α → false)

Equations

classical.type_decidable α = classical.type_decidable._match_1 α (classical.prop_decidable (nonempty α))
classical.type_decidable._match_1 α (is_true hp) = psum.inl default
classical.type_decidable._match_1 α (is_false hn) = psum.inr _

noncomputable def classical.strong_indefinite_description {α : Sort u} (p : α → Prop) (h : nonempty α) :

{x // (∃ (y : α), p y) → p x}

Equations

classical.strong_indefinite_description p h = dite (∃ (x : α), p x) (λ (hp : ∃ (x : α), p x), let xp : {x // p x} := classical.indefinite_description (λ (x : α), p x) hp in ⟨xp.val, _⟩) (λ (hp : ¬∃ (x : α), p x), ⟨classical.choice h, _⟩)

noncomputable def classical.epsilon {α : Sort u} [h : nonempty α] (p : α → Prop) :

α

Equations

classical.epsilon p = (classical.strong_indefinite_description p h).val

theorem classical.epsilon_spec_aux {α : Sort u} (h : nonempty α) (p : α → Prop) :

(∃ (y : α), p y) → p (classical.epsilon p)

theorem classical.epsilon_spec {α : Sort u} {p : α → Prop} (hex : ∃ (y : α), p y) :

p (classical.epsilon p)

theorem classical.epsilon_singleton {α : Sort u} (x : α) :

classical.epsilon (λ (y : α), y = x) = x

theorem classical.axiom_of_choice {α : Sort u} {β : α → Sort v} {r : Π (x : α), β x → Prop} (h : ∀ (x : α), ∃ (y : β x), r x y) :

∃ (f : Π (x : α), β x), ∀ (x : α), r x (f x)

theorem classical.skolem {α : Sort u} {b : α → Sort v} {p : Π (x : α), b x → Prop} :

(∀ (x : α), ∃ (y : b x), p x y) ↔ ∃ (f : Π (x : α), b x), ∀ (x : α), p x (f x)

theorem classical.prop_complete (a : Prop) :

a = true ∨ a = false

theorem classical.cases_true_false (p : Prop → Prop) (h1 : p true) (h2 : p false) (a : Prop) :

p a

theorem classical.cases_on (a : Prop) {p : Prop → Prop} (h1 : p true) (h2 : p false) :

p a

theorem classical.by_cases {p q : Prop} (hpq : p → q) (hnpq : ¬p → q) :

q

theorem classical.by_contradiction {p : Prop} (h : ¬p → false) :

p

theorem classical.eq_false_or_eq_true (a : Prop) :

a = false ∨ a = true