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

Theorem ordtri2orexmid 4524
Description: Ordinal trichotomy implies excluded middle. (Contributed by Jim Kingdon, 31-Jul-2019.)
Hypothesis
Ref Expression
ordtri2orexmid.1 𝑥 ∈ On ∀𝑦 ∈ On (𝑥𝑦𝑦𝑥)
Assertion
Ref Expression
ordtri2orexmid (𝜑 ∨ ¬ 𝜑)
Distinct variable group:   𝜑,𝑥,𝑦

Proof of Theorem ordtri2orexmid
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 ordtri2orexmid.1 . . . 4 𝑥 ∈ On ∀𝑦 ∈ On (𝑥𝑦𝑦𝑥)
2 ordtriexmidlem 4520 . . . . 5 {𝑧 ∈ {∅} ∣ 𝜑} ∈ On
3 suc0 4413 . . . . . 6 suc ∅ = {∅}
4 0elon 4394 . . . . . . 7 ∅ ∈ On
54onsuci 4517 . . . . . 6 suc ∅ ∈ On
63, 5eqeltrri 2251 . . . . 5 {∅} ∈ On
7 eleq1 2240 . . . . . . 7 (𝑥 = {𝑧 ∈ {∅} ∣ 𝜑} → (𝑥𝑦 ↔ {𝑧 ∈ {∅} ∣ 𝜑} ∈ 𝑦))
8 sseq2 3181 . . . . . . 7 (𝑥 = {𝑧 ∈ {∅} ∣ 𝜑} → (𝑦𝑥𝑦 ⊆ {𝑧 ∈ {∅} ∣ 𝜑}))
97, 8orbi12d 793 . . . . . 6 (𝑥 = {𝑧 ∈ {∅} ∣ 𝜑} → ((𝑥𝑦𝑦𝑥) ↔ ({𝑧 ∈ {∅} ∣ 𝜑} ∈ 𝑦𝑦 ⊆ {𝑧 ∈ {∅} ∣ 𝜑})))
10 eleq2 2241 . . . . . . 7 (𝑦 = {∅} → ({𝑧 ∈ {∅} ∣ 𝜑} ∈ 𝑦 ↔ {𝑧 ∈ {∅} ∣ 𝜑} ∈ {∅}))
11 sseq1 3180 . . . . . . 7 (𝑦 = {∅} → (𝑦 ⊆ {𝑧 ∈ {∅} ∣ 𝜑} ↔ {∅} ⊆ {𝑧 ∈ {∅} ∣ 𝜑}))
1210, 11orbi12d 793 . . . . . 6 (𝑦 = {∅} → (({𝑧 ∈ {∅} ∣ 𝜑} ∈ 𝑦𝑦 ⊆ {𝑧 ∈ {∅} ∣ 𝜑}) ↔ ({𝑧 ∈ {∅} ∣ 𝜑} ∈ {∅} ∨ {∅} ⊆ {𝑧 ∈ {∅} ∣ 𝜑})))
139, 12rspc2va 2857 . . . . 5 ((({𝑧 ∈ {∅} ∣ 𝜑} ∈ On ∧ {∅} ∈ On) ∧ ∀𝑥 ∈ On ∀𝑦 ∈ On (𝑥𝑦𝑦𝑥)) → ({𝑧 ∈ {∅} ∣ 𝜑} ∈ {∅} ∨ {∅} ⊆ {𝑧 ∈ {∅} ∣ 𝜑}))
142, 6, 13mpanl12 436 . . . 4 (∀𝑥 ∈ On ∀𝑦 ∈ On (𝑥𝑦𝑦𝑥) → ({𝑧 ∈ {∅} ∣ 𝜑} ∈ {∅} ∨ {∅} ⊆ {𝑧 ∈ {∅} ∣ 𝜑}))
151, 14ax-mp 5 . . 3 ({𝑧 ∈ {∅} ∣ 𝜑} ∈ {∅} ∨ {∅} ⊆ {𝑧 ∈ {∅} ∣ 𝜑})
16 elsni 3612 . . . . 5 ({𝑧 ∈ {∅} ∣ 𝜑} ∈ {∅} → {𝑧 ∈ {∅} ∣ 𝜑} = ∅)
17 ordtriexmidlem2 4521 . . . . 5 ({𝑧 ∈ {∅} ∣ 𝜑} = ∅ → ¬ 𝜑)
1816, 17syl 14 . . . 4 ({𝑧 ∈ {∅} ∣ 𝜑} ∈ {∅} → ¬ 𝜑)
19 snssg 3728 . . . . . 6 (∅ ∈ On → (∅ ∈ {𝑧 ∈ {∅} ∣ 𝜑} ↔ {∅} ⊆ {𝑧 ∈ {∅} ∣ 𝜑}))
204, 19ax-mp 5 . . . . 5 (∅ ∈ {𝑧 ∈ {∅} ∣ 𝜑} ↔ {∅} ⊆ {𝑧 ∈ {∅} ∣ 𝜑})
21 0ex 4132 . . . . . . . 8 ∅ ∈ V
2221snid 3625 . . . . . . 7 ∅ ∈ {∅}
23 biidd 172 . . . . . . . 8 (𝑧 = ∅ → (𝜑𝜑))
2423elrab3 2896 . . . . . . 7 (∅ ∈ {∅} → (∅ ∈ {𝑧 ∈ {∅} ∣ 𝜑} ↔ 𝜑))
2522, 24ax-mp 5 . . . . . 6 (∅ ∈ {𝑧 ∈ {∅} ∣ 𝜑} ↔ 𝜑)
2625biimpi 120 . . . . 5 (∅ ∈ {𝑧 ∈ {∅} ∣ 𝜑} → 𝜑)
2720, 26sylbir 135 . . . 4 ({∅} ⊆ {𝑧 ∈ {∅} ∣ 𝜑} → 𝜑)
2818, 27orim12i 759 . . 3 (({𝑧 ∈ {∅} ∣ 𝜑} ∈ {∅} ∨ {∅} ⊆ {𝑧 ∈ {∅} ∣ 𝜑}) → (¬ 𝜑𝜑))
2915, 28ax-mp 5 . 2 𝜑𝜑)
30 orcom 728 . 2 ((¬ 𝜑𝜑) ↔ (𝜑 ∨ ¬ 𝜑))
3129, 30mpbi 145 1 (𝜑 ∨ ¬ 𝜑)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wb 105  wo 708   = wceq 1353  wcel 2148  wral 2455  {crab 2459  wss 3131  c0 3424  {csn 3594  Oncon0 4365  suc csuc 4367
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-nul 4131  ax-pow 4176  ax-pr 4211  ax-un 4435
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-rab 2464  df-v 2741  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-nul 3425  df-pw 3579  df-sn 3600  df-pr 3601  df-uni 3812  df-tr 4104  df-iord 4368  df-on 4370  df-suc 4373
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator