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

Theorem ordtri2or2exmid 4548
Description: Ordinal trichotomy implies excluded middle. (Contributed by Jim Kingdon, 29-Aug-2021.)
Hypothesis
Ref Expression
ordtri2or2exmid.1 𝑥 ∈ On ∀𝑦 ∈ On (𝑥𝑦𝑦𝑥)
Assertion
Ref Expression
ordtri2or2exmid (𝜑 ∨ ¬ 𝜑)
Distinct variable group:   𝜑,𝑥,𝑦

Proof of Theorem ordtri2or2exmid
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 ordtri2or2exmid.1 . . . 4 𝑥 ∈ On ∀𝑦 ∈ On (𝑥𝑦𝑦𝑥)
2 ordtri2or2exmidlem 4503 . . . . 5 {𝑧 ∈ {∅, {∅}} ∣ 𝜑} ∈ On
3 suc0 4389 . . . . . 6 suc ∅ = {∅}
4 0elon 4370 . . . . . . 7 ∅ ∈ On
54onsuci 4493 . . . . . 6 suc ∅ ∈ On
63, 5eqeltrri 2240 . . . . 5 {∅} ∈ On
7 sseq1 3165 . . . . . . 7 (𝑥 = {𝑧 ∈ {∅, {∅}} ∣ 𝜑} → (𝑥𝑦 ↔ {𝑧 ∈ {∅, {∅}} ∣ 𝜑} ⊆ 𝑦))
8 sseq2 3166 . . . . . . 7 (𝑥 = {𝑧 ∈ {∅, {∅}} ∣ 𝜑} → (𝑦𝑥𝑦 ⊆ {𝑧 ∈ {∅, {∅}} ∣ 𝜑}))
97, 8orbi12d 783 . . . . . 6 (𝑥 = {𝑧 ∈ {∅, {∅}} ∣ 𝜑} → ((𝑥𝑦𝑦𝑥) ↔ ({𝑧 ∈ {∅, {∅}} ∣ 𝜑} ⊆ 𝑦𝑦 ⊆ {𝑧 ∈ {∅, {∅}} ∣ 𝜑})))
10 sseq2 3166 . . . . . . 7 (𝑦 = {∅} → ({𝑧 ∈ {∅, {∅}} ∣ 𝜑} ⊆ 𝑦 ↔ {𝑧 ∈ {∅, {∅}} ∣ 𝜑} ⊆ {∅}))
11 sseq1 3165 . . . . . . 7 (𝑦 = {∅} → (𝑦 ⊆ {𝑧 ∈ {∅, {∅}} ∣ 𝜑} ↔ {∅} ⊆ {𝑧 ∈ {∅, {∅}} ∣ 𝜑}))
1210, 11orbi12d 783 . . . . . 6 (𝑦 = {∅} → (({𝑧 ∈ {∅, {∅}} ∣ 𝜑} ⊆ 𝑦𝑦 ⊆ {𝑧 ∈ {∅, {∅}} ∣ 𝜑}) ↔ ({𝑧 ∈ {∅, {∅}} ∣ 𝜑} ⊆ {∅} ∨ {∅} ⊆ {𝑧 ∈ {∅, {∅}} ∣ 𝜑})))
139, 12rspc2va 2844 . . . . 5 ((({𝑧 ∈ {∅, {∅}} ∣ 𝜑} ∈ On ∧ {∅} ∈ On) ∧ ∀𝑥 ∈ On ∀𝑦 ∈ On (𝑥𝑦𝑦𝑥)) → ({𝑧 ∈ {∅, {∅}} ∣ 𝜑} ⊆ {∅} ∨ {∅} ⊆ {𝑧 ∈ {∅, {∅}} ∣ 𝜑}))
142, 6, 13mpanl12 433 . . . 4 (∀𝑥 ∈ On ∀𝑦 ∈ On (𝑥𝑦𝑦𝑥) → ({𝑧 ∈ {∅, {∅}} ∣ 𝜑} ⊆ {∅} ∨ {∅} ⊆ {𝑧 ∈ {∅, {∅}} ∣ 𝜑}))
151, 14ax-mp 5 . . 3 ({𝑧 ∈ {∅, {∅}} ∣ 𝜑} ⊆ {∅} ∨ {∅} ⊆ {𝑧 ∈ {∅, {∅}} ∣ 𝜑})
16 elirr 4518 . . . . 5 ¬ {∅} ∈ {∅}
17 simpl 108 . . . . . . 7 (({𝑧 ∈ {∅, {∅}} ∣ 𝜑} ⊆ {∅} ∧ 𝜑) → {𝑧 ∈ {∅, {∅}} ∣ 𝜑} ⊆ {∅})
18 simpr 109 . . . . . . . 8 (({𝑧 ∈ {∅, {∅}} ∣ 𝜑} ⊆ {∅} ∧ 𝜑) → 𝜑)
19 p0ex 4167 . . . . . . . . . 10 {∅} ∈ V
2019prid2 3683 . . . . . . . . 9 {∅} ∈ {∅, {∅}}
21 biidd 171 . . . . . . . . . 10 (𝑧 = {∅} → (𝜑𝜑))
2221elrab3 2883 . . . . . . . . 9 ({∅} ∈ {∅, {∅}} → ({∅} ∈ {𝑧 ∈ {∅, {∅}} ∣ 𝜑} ↔ 𝜑))
2320, 22ax-mp 5 . . . . . . . 8 ({∅} ∈ {𝑧 ∈ {∅, {∅}} ∣ 𝜑} ↔ 𝜑)
2418, 23sylibr 133 . . . . . . 7 (({𝑧 ∈ {∅, {∅}} ∣ 𝜑} ⊆ {∅} ∧ 𝜑) → {∅} ∈ {𝑧 ∈ {∅, {∅}} ∣ 𝜑})
2517, 24sseldd 3143 . . . . . 6 (({𝑧 ∈ {∅, {∅}} ∣ 𝜑} ⊆ {∅} ∧ 𝜑) → {∅} ∈ {∅})
2625ex 114 . . . . 5 ({𝑧 ∈ {∅, {∅}} ∣ 𝜑} ⊆ {∅} → (𝜑 → {∅} ∈ {∅}))
2716, 26mtoi 654 . . . 4 ({𝑧 ∈ {∅, {∅}} ∣ 𝜑} ⊆ {∅} → ¬ 𝜑)
28 snssg 3709 . . . . . 6 (∅ ∈ On → (∅ ∈ {𝑧 ∈ {∅, {∅}} ∣ 𝜑} ↔ {∅} ⊆ {𝑧 ∈ {∅, {∅}} ∣ 𝜑}))
294, 28ax-mp 5 . . . . 5 (∅ ∈ {𝑧 ∈ {∅, {∅}} ∣ 𝜑} ↔ {∅} ⊆ {𝑧 ∈ {∅, {∅}} ∣ 𝜑})
30 0ex 4109 . . . . . . . 8 ∅ ∈ V
3130prid1 3682 . . . . . . 7 ∅ ∈ {∅, {∅}}
32 biidd 171 . . . . . . . 8 (𝑧 = ∅ → (𝜑𝜑))
3332elrab3 2883 . . . . . . 7 (∅ ∈ {∅, {∅}} → (∅ ∈ {𝑧 ∈ {∅, {∅}} ∣ 𝜑} ↔ 𝜑))
3431, 33ax-mp 5 . . . . . 6 (∅ ∈ {𝑧 ∈ {∅, {∅}} ∣ 𝜑} ↔ 𝜑)
3534biimpi 119 . . . . 5 (∅ ∈ {𝑧 ∈ {∅, {∅}} ∣ 𝜑} → 𝜑)
3629, 35sylbir 134 . . . 4 ({∅} ⊆ {𝑧 ∈ {∅, {∅}} ∣ 𝜑} → 𝜑)
3727, 36orim12i 749 . . 3 (({𝑧 ∈ {∅, {∅}} ∣ 𝜑} ⊆ {∅} ∨ {∅} ⊆ {𝑧 ∈ {∅, {∅}} ∣ 𝜑}) → (¬ 𝜑𝜑))
3815, 37ax-mp 5 . 2 𝜑𝜑)
39 orcom 718 . 2 ((¬ 𝜑𝜑) ↔ (𝜑 ∨ ¬ 𝜑))
4038, 39mpbi 144 1 (𝜑 ∨ ¬ 𝜑)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wa 103  wb 104  wo 698   = wceq 1343  wcel 2136  wral 2444  {crab 2448  wss 3116  c0 3409  {csn 3576  {cpr 3577  Oncon0 4341  suc csuc 4343
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-nul 4108  ax-pow 4153  ax-pr 4187  ax-un 4411  ax-setind 4514
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-ral 2449  df-rex 2450  df-rab 2453  df-v 2728  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-nul 3410  df-pw 3561  df-sn 3582  df-pr 3583  df-uni 3790  df-tr 4081  df-iord 4344  df-on 4346  df-suc 4349
This theorem is referenced by:  onintexmid  4550
  Copyright terms: Public domain W3C validator