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

Theorem 0elsucexmid 4542
Description: If the successor of any ordinal class contains the empty set, excluded middle follows. (Contributed by Jim Kingdon, 3-Sep-2021.)
Hypothesis
Ref Expression
0elsucexmid.1 𝑥 ∈ On ∅ ∈ suc 𝑥
Assertion
Ref Expression
0elsucexmid (𝜑 ∨ ¬ 𝜑)
Distinct variable group:   𝜑,𝑥

Proof of Theorem 0elsucexmid
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 ordtriexmidlem 4496 . . . 4 {𝑦 ∈ {∅} ∣ 𝜑} ∈ On
2 0elsucexmid.1 . . . 4 𝑥 ∈ On ∅ ∈ suc 𝑥
3 suceq 4380 . . . . . 6 (𝑥 = {𝑦 ∈ {∅} ∣ 𝜑} → suc 𝑥 = suc {𝑦 ∈ {∅} ∣ 𝜑})
43eleq2d 2236 . . . . 5 (𝑥 = {𝑦 ∈ {∅} ∣ 𝜑} → (∅ ∈ suc 𝑥 ↔ ∅ ∈ suc {𝑦 ∈ {∅} ∣ 𝜑}))
54rspcv 2826 . . . 4 ({𝑦 ∈ {∅} ∣ 𝜑} ∈ On → (∀𝑥 ∈ On ∅ ∈ suc 𝑥 → ∅ ∈ suc {𝑦 ∈ {∅} ∣ 𝜑}))
61, 2, 5mp2 16 . . 3 ∅ ∈ suc {𝑦 ∈ {∅} ∣ 𝜑}
7 0ex 4109 . . . 4 ∅ ∈ V
87elsuc 4384 . . 3 (∅ ∈ suc {𝑦 ∈ {∅} ∣ 𝜑} ↔ (∅ ∈ {𝑦 ∈ {∅} ∣ 𝜑} ∨ ∅ = {𝑦 ∈ {∅} ∣ 𝜑}))
96, 8mpbi 144 . 2 (∅ ∈ {𝑦 ∈ {∅} ∣ 𝜑} ∨ ∅ = {𝑦 ∈ {∅} ∣ 𝜑})
107snid 3607 . . . . 5 ∅ ∈ {∅}
11 biidd 171 . . . . . 6 (𝑦 = ∅ → (𝜑𝜑))
1211elrab3 2883 . . . . 5 (∅ ∈ {∅} → (∅ ∈ {𝑦 ∈ {∅} ∣ 𝜑} ↔ 𝜑))
1310, 12ax-mp 5 . . . 4 (∅ ∈ {𝑦 ∈ {∅} ∣ 𝜑} ↔ 𝜑)
1413biimpi 119 . . 3 (∅ ∈ {𝑦 ∈ {∅} ∣ 𝜑} → 𝜑)
15 ordtriexmidlem2 4497 . . . 4 ({𝑦 ∈ {∅} ∣ 𝜑} = ∅ → ¬ 𝜑)
1615eqcoms 2168 . . 3 (∅ = {𝑦 ∈ {∅} ∣ 𝜑} → ¬ 𝜑)
1714, 16orim12i 749 . 2 ((∅ ∈ {𝑦 ∈ {∅} ∣ 𝜑} ∨ ∅ = {𝑦 ∈ {∅} ∣ 𝜑}) → (𝜑 ∨ ¬ 𝜑))
189, 17ax-mp 5 1 (𝜑 ∨ ¬ 𝜑)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wb 104  wo 698   = wceq 1343  wcel 2136  wral 2444  {crab 2448  c0 3409  {csn 3576  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-14 2139  ax-ext 2147  ax-sep 4100  ax-nul 4108  ax-pow 4153
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-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-uni 3790  df-tr 4081  df-iord 4344  df-on 4346  df-suc 4349
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator