ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ontriexmidim GIF version

Theorem ontriexmidim 4620
Description: Ordinal trichotomy implies excluded middle. Closed form of ordtriexmid 4619. (Contributed by Jim Kingdon, 26-Aug-2024.)
Assertion
Ref Expression
ontriexmidim (∀𝑥 ∈ On ∀𝑦 ∈ On (𝑥𝑦𝑥 = 𝑦𝑦𝑥) → DECID 𝜑)
Distinct variable group:   𝜑,𝑥,𝑦

Proof of Theorem ontriexmidim
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 noel 3498 . . . . . 6 ¬ {𝑧 ∈ {∅} ∣ 𝜑} ∈ ∅
21a1i 9 . . . . 5 (∀𝑥 ∈ On ∀𝑦 ∈ On (𝑥𝑦𝑥 = 𝑦𝑦𝑥) → ¬ {𝑧 ∈ {∅} ∣ 𝜑} ∈ ∅)
3 ordtriexmidlem 4617 . . . . . . . 8 {𝑧 ∈ {∅} ∣ 𝜑} ∈ On
4 0elon 4489 . . . . . . . 8 ∅ ∈ On
5 eleq1 2294 . . . . . . . . . 10 (𝑥 = {𝑧 ∈ {∅} ∣ 𝜑} → (𝑥𝑦 ↔ {𝑧 ∈ {∅} ∣ 𝜑} ∈ 𝑦))
6 eqeq1 2238 . . . . . . . . . 10 (𝑥 = {𝑧 ∈ {∅} ∣ 𝜑} → (𝑥 = 𝑦 ↔ {𝑧 ∈ {∅} ∣ 𝜑} = 𝑦))
7 eleq2 2295 . . . . . . . . . 10 (𝑥 = {𝑧 ∈ {∅} ∣ 𝜑} → (𝑦𝑥𝑦 ∈ {𝑧 ∈ {∅} ∣ 𝜑}))
85, 6, 73orbi123d 1347 . . . . . . . . 9 (𝑥 = {𝑧 ∈ {∅} ∣ 𝜑} → ((𝑥𝑦𝑥 = 𝑦𝑦𝑥) ↔ ({𝑧 ∈ {∅} ∣ 𝜑} ∈ 𝑦 ∨ {𝑧 ∈ {∅} ∣ 𝜑} = 𝑦𝑦 ∈ {𝑧 ∈ {∅} ∣ 𝜑})))
9 eleq2 2295 . . . . . . . . . 10 (𝑦 = ∅ → ({𝑧 ∈ {∅} ∣ 𝜑} ∈ 𝑦 ↔ {𝑧 ∈ {∅} ∣ 𝜑} ∈ ∅))
10 eqeq2 2241 . . . . . . . . . 10 (𝑦 = ∅ → ({𝑧 ∈ {∅} ∣ 𝜑} = 𝑦 ↔ {𝑧 ∈ {∅} ∣ 𝜑} = ∅))
11 eleq1 2294 . . . . . . . . . 10 (𝑦 = ∅ → (𝑦 ∈ {𝑧 ∈ {∅} ∣ 𝜑} ↔ ∅ ∈ {𝑧 ∈ {∅} ∣ 𝜑}))
129, 10, 113orbi123d 1347 . . . . . . . . 9 (𝑦 = ∅ → (({𝑧 ∈ {∅} ∣ 𝜑} ∈ 𝑦 ∨ {𝑧 ∈ {∅} ∣ 𝜑} = 𝑦𝑦 ∈ {𝑧 ∈ {∅} ∣ 𝜑}) ↔ ({𝑧 ∈ {∅} ∣ 𝜑} ∈ ∅ ∨ {𝑧 ∈ {∅} ∣ 𝜑} = ∅ ∨ ∅ ∈ {𝑧 ∈ {∅} ∣ 𝜑})))
138, 12rspc2v 2923 . . . . . . . 8 (({𝑧 ∈ {∅} ∣ 𝜑} ∈ On ∧ ∅ ∈ On) → (∀𝑥 ∈ On ∀𝑦 ∈ On (𝑥𝑦𝑥 = 𝑦𝑦𝑥) → ({𝑧 ∈ {∅} ∣ 𝜑} ∈ ∅ ∨ {𝑧 ∈ {∅} ∣ 𝜑} = ∅ ∨ ∅ ∈ {𝑧 ∈ {∅} ∣ 𝜑})))
143, 4, 13mp2an 426 . . . . . . 7 (∀𝑥 ∈ On ∀𝑦 ∈ On (𝑥𝑦𝑥 = 𝑦𝑦𝑥) → ({𝑧 ∈ {∅} ∣ 𝜑} ∈ ∅ ∨ {𝑧 ∈ {∅} ∣ 𝜑} = ∅ ∨ ∅ ∈ {𝑧 ∈ {∅} ∣ 𝜑}))
15 3orass 1007 . . . . . . 7 (({𝑧 ∈ {∅} ∣ 𝜑} ∈ ∅ ∨ {𝑧 ∈ {∅} ∣ 𝜑} = ∅ ∨ ∅ ∈ {𝑧 ∈ {∅} ∣ 𝜑}) ↔ ({𝑧 ∈ {∅} ∣ 𝜑} ∈ ∅ ∨ ({𝑧 ∈ {∅} ∣ 𝜑} = ∅ ∨ ∅ ∈ {𝑧 ∈ {∅} ∣ 𝜑})))
1614, 15sylib 122 . . . . . 6 (∀𝑥 ∈ On ∀𝑦 ∈ On (𝑥𝑦𝑥 = 𝑦𝑦𝑥) → ({𝑧 ∈ {∅} ∣ 𝜑} ∈ ∅ ∨ ({𝑧 ∈ {∅} ∣ 𝜑} = ∅ ∨ ∅ ∈ {𝑧 ∈ {∅} ∣ 𝜑})))
1716orcomd 736 . . . . 5 (∀𝑥 ∈ On ∀𝑦 ∈ On (𝑥𝑦𝑥 = 𝑦𝑦𝑥) → (({𝑧 ∈ {∅} ∣ 𝜑} = ∅ ∨ ∅ ∈ {𝑧 ∈ {∅} ∣ 𝜑}) ∨ {𝑧 ∈ {∅} ∣ 𝜑} ∈ ∅))
182, 17ecased 1385 . . . 4 (∀𝑥 ∈ On ∀𝑦 ∈ On (𝑥𝑦𝑥 = 𝑦𝑦𝑥) → ({𝑧 ∈ {∅} ∣ 𝜑} = ∅ ∨ ∅ ∈ {𝑧 ∈ {∅} ∣ 𝜑}))
19 ordtriexmidlem2 4618 . . . . 5 ({𝑧 ∈ {∅} ∣ 𝜑} = ∅ → ¬ 𝜑)
20 0ex 4216 . . . . . . . 8 ∅ ∈ V
2120snid 3700 . . . . . . 7 ∅ ∈ {∅}
22 biidd 172 . . . . . . . 8 (𝑧 = ∅ → (𝜑𝜑))
2322elrab3 2963 . . . . . . 7 (∅ ∈ {∅} → (∅ ∈ {𝑧 ∈ {∅} ∣ 𝜑} ↔ 𝜑))
2421, 23ax-mp 5 . . . . . 6 (∅ ∈ {𝑧 ∈ {∅} ∣ 𝜑} ↔ 𝜑)
2524biimpi 120 . . . . 5 (∅ ∈ {𝑧 ∈ {∅} ∣ 𝜑} → 𝜑)
2619, 25orim12i 766 . . . 4 (({𝑧 ∈ {∅} ∣ 𝜑} = ∅ ∨ ∅ ∈ {𝑧 ∈ {∅} ∣ 𝜑}) → (¬ 𝜑𝜑))
2718, 26syl 14 . . 3 (∀𝑥 ∈ On ∀𝑦 ∈ On (𝑥𝑦𝑥 = 𝑦𝑦𝑥) → (¬ 𝜑𝜑))
2827orcomd 736 . 2 (∀𝑥 ∈ On ∀𝑦 ∈ On (𝑥𝑦𝑥 = 𝑦𝑦𝑥) → (𝜑 ∨ ¬ 𝜑))
29 df-dc 842 . 2 (DECID 𝜑 ↔ (𝜑 ∨ ¬ 𝜑))
3028, 29sylibr 134 1 (∀𝑥 ∈ On ∀𝑦 ∈ On (𝑥𝑦𝑥 = 𝑦𝑦𝑥) → DECID 𝜑)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wb 105  wo 715  DECID wdc 841  w3o 1003   = wceq 1397  wcel 2202  wral 2510  {crab 2514  c0 3494  {csn 3669  Oncon0 4460
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-nul 4215  ax-pow 4264
This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-uni 3894  df-tr 4188  df-iord 4463  df-on 4465  df-suc 4468
This theorem is referenced by:  exmidontri  7456
  Copyright terms: Public domain W3C validator