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

Theorem onsucelsucexmidlem 4530
Description: Lemma for onsucelsucexmid 4531. The set {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)} appears as 𝐴 in the proof of Theorem 1.3 in [Bauer] p. 483 (see acexmidlema 5868), and similar sets also appear in other proofs that various propositions imply excluded middle, for example in ordtriexmidlem 4520. (Contributed by Jim Kingdon, 2-Aug-2019.)
Assertion
Ref Expression
onsucelsucexmidlem {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)} ∈ On
Distinct variable group:   𝜑,𝑥

Proof of Theorem onsucelsucexmidlem
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpll 527 . . . . . . . 8 (((𝑦𝑧𝑧 ∈ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)}) ∧ 𝑧 = ∅) → 𝑦𝑧)
2 noel 3428 . . . . . . . . . 10 ¬ 𝑦 ∈ ∅
3 eleq2 2241 . . . . . . . . . 10 (𝑧 = ∅ → (𝑦𝑧𝑦 ∈ ∅))
42, 3mtbiri 675 . . . . . . . . 9 (𝑧 = ∅ → ¬ 𝑦𝑧)
54adantl 277 . . . . . . . 8 (((𝑦𝑧𝑧 ∈ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)}) ∧ 𝑧 = ∅) → ¬ 𝑦𝑧)
61, 5pm2.21dd 620 . . . . . . 7 (((𝑦𝑧𝑧 ∈ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)}) ∧ 𝑧 = ∅) → 𝑦 ∈ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)})
76ex 115 . . . . . 6 ((𝑦𝑧𝑧 ∈ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)}) → (𝑧 = ∅ → 𝑦 ∈ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)}))
8 eleq2 2241 . . . . . . . . . . 11 (𝑧 = {∅} → (𝑦𝑧𝑦 ∈ {∅}))
98biimpac 298 . . . . . . . . . 10 ((𝑦𝑧𝑧 = {∅}) → 𝑦 ∈ {∅})
10 velsn 3611 . . . . . . . . . 10 (𝑦 ∈ {∅} ↔ 𝑦 = ∅)
119, 10sylib 122 . . . . . . . . 9 ((𝑦𝑧𝑧 = {∅}) → 𝑦 = ∅)
12 onsucelsucexmidlem1 4529 . . . . . . . . 9 ∅ ∈ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)}
1311, 12eqeltrdi 2268 . . . . . . . 8 ((𝑦𝑧𝑧 = {∅}) → 𝑦 ∈ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)})
1413ex 115 . . . . . . 7 (𝑦𝑧 → (𝑧 = {∅} → 𝑦 ∈ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)}))
1514adantr 276 . . . . . 6 ((𝑦𝑧𝑧 ∈ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)}) → (𝑧 = {∅} → 𝑦 ∈ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)}))
16 elrabi 2892 . . . . . . . 8 (𝑧 ∈ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)} → 𝑧 ∈ {∅, {∅}})
17 vex 2742 . . . . . . . . 9 𝑧 ∈ V
1817elpr 3615 . . . . . . . 8 (𝑧 ∈ {∅, {∅}} ↔ (𝑧 = ∅ ∨ 𝑧 = {∅}))
1916, 18sylib 122 . . . . . . 7 (𝑧 ∈ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)} → (𝑧 = ∅ ∨ 𝑧 = {∅}))
2019adantl 277 . . . . . 6 ((𝑦𝑧𝑧 ∈ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)}) → (𝑧 = ∅ ∨ 𝑧 = {∅}))
217, 15, 20mpjaod 718 . . . . 5 ((𝑦𝑧𝑧 ∈ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)}) → 𝑦 ∈ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)})
2221gen2 1450 . . . 4 𝑦𝑧((𝑦𝑧𝑧 ∈ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)}) → 𝑦 ∈ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)})
23 dftr2 4105 . . . 4 (Tr {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)} ↔ ∀𝑦𝑧((𝑦𝑧𝑧 ∈ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)}) → 𝑦 ∈ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)}))
2422, 23mpbir 146 . . 3 Tr {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)}
25 ssrab2 3242 . . 3 {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)} ⊆ {∅, {∅}}
26 2ordpr 4525 . . 3 Ord {∅, {∅}}
27 trssord 4382 . . 3 ((Tr {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)} ∧ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)} ⊆ {∅, {∅}} ∧ Ord {∅, {∅}}) → Ord {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)})
2824, 25, 26, 27mp3an 1337 . 2 Ord {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)}
29 pp0ex 4191 . . . 4 {∅, {∅}} ∈ V
3029rabex 4149 . . 3 {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)} ∈ V
3130elon 4376 . 2 ({𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)} ∈ On ↔ Ord {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)})
3228, 31mpbir 146 1 {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)} ∈ On
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wo 708  wal 1351   = wceq 1353  wcel 2148  {crab 2459  wss 3131  c0 3424  {csn 3594  {cpr 3595  Tr wtr 4103  Ord word 4364  Oncon0 4365
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-14 2151  ax-ext 2159  ax-sep 4123  ax-nul 4131  ax-pow 4176
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:  onsucelsucexmid  4531  acexmidlemcase  5872  acexmidlemv  5875
  Copyright terms: Public domain W3C validator