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

Theorem reg2exmidlema 4632
Description: Lemma for reg2exmid 4634. If 𝐴 has a minimal element (expressed by ), excluded middle follows. (Contributed by Jim Kingdon, 2-Oct-2021.)
Hypothesis
Ref Expression
regexmidlemm.a 𝐴 = {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = {∅} ∨ (𝑥 = ∅ ∧ 𝜑))}
Assertion
Ref Expression
reg2exmidlema (∃𝑢𝐴𝑣𝐴 𝑢𝑣 → (𝜑 ∨ ¬ 𝜑))
Distinct variable groups:   𝜑,𝑥   𝑣,𝐴   𝜑,𝑢,𝑥   𝑣,𝑢
Allowed substitution hints:   𝜑(𝑣)   𝐴(𝑥,𝑢)

Proof of Theorem reg2exmidlema
StepHypRef Expression
1 simplr 529 . . . . . . 7 (((𝑢𝐴 ∧ ∀𝑣𝐴 𝑢𝑣) ∧ 𝑢 = {∅}) → ∀𝑣𝐴 𝑢𝑣)
2 sseq1 3250 . . . . . . . . 9 (𝑢 = {∅} → (𝑢𝑣 ↔ {∅} ⊆ 𝑣))
32ralbidv 2532 . . . . . . . 8 (𝑢 = {∅} → (∀𝑣𝐴 𝑢𝑣 ↔ ∀𝑣𝐴 {∅} ⊆ 𝑣))
43adantl 277 . . . . . . 7 (((𝑢𝐴 ∧ ∀𝑣𝐴 𝑢𝑣) ∧ 𝑢 = {∅}) → (∀𝑣𝐴 𝑢𝑣 ↔ ∀𝑣𝐴 {∅} ⊆ 𝑣))
51, 4mpbid 147 . . . . . 6 (((𝑢𝐴 ∧ ∀𝑣𝐴 𝑢𝑣) ∧ 𝑢 = {∅}) → ∀𝑣𝐴 {∅} ⊆ 𝑣)
6 0ex 4216 . . . . . . . 8 ∅ ∈ V
76snss 3808 . . . . . . 7 (∅ ∈ 𝑣 ↔ {∅} ⊆ 𝑣)
87ralbii 2538 . . . . . 6 (∀𝑣𝐴 ∅ ∈ 𝑣 ↔ ∀𝑣𝐴 {∅} ⊆ 𝑣)
95, 8sylibr 134 . . . . 5 (((𝑢𝐴 ∧ ∀𝑣𝐴 𝑢𝑣) ∧ 𝑢 = {∅}) → ∀𝑣𝐴 ∅ ∈ 𝑣)
10 noel 3498 . . . . . 6 ¬ ∅ ∈ ∅
11 eqid 2231 . . . . . . . . . . . 12 ∅ = ∅
1211jctl 314 . . . . . . . . . . 11 (𝜑 → (∅ = ∅ ∧ 𝜑))
1312olcd 741 . . . . . . . . . 10 (𝜑 → (∅ = {∅} ∨ (∅ = ∅ ∧ 𝜑)))
146prid1 3777 . . . . . . . . . 10 ∅ ∈ {∅, {∅}}
1513, 14jctil 312 . . . . . . . . 9 (𝜑 → (∅ ∈ {∅, {∅}} ∧ (∅ = {∅} ∨ (∅ = ∅ ∧ 𝜑))))
16 eqeq1 2238 . . . . . . . . . . 11 (𝑥 = ∅ → (𝑥 = {∅} ↔ ∅ = {∅}))
17 eqeq1 2238 . . . . . . . . . . . 12 (𝑥 = ∅ → (𝑥 = ∅ ↔ ∅ = ∅))
1817anbi1d 465 . . . . . . . . . . 11 (𝑥 = ∅ → ((𝑥 = ∅ ∧ 𝜑) ↔ (∅ = ∅ ∧ 𝜑)))
1916, 18orbi12d 800 . . . . . . . . . 10 (𝑥 = ∅ → ((𝑥 = {∅} ∨ (𝑥 = ∅ ∧ 𝜑)) ↔ (∅ = {∅} ∨ (∅ = ∅ ∧ 𝜑))))
20 regexmidlemm.a . . . . . . . . . 10 𝐴 = {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = {∅} ∨ (𝑥 = ∅ ∧ 𝜑))}
2119, 20elrab2 2965 . . . . . . . . 9 (∅ ∈ 𝐴 ↔ (∅ ∈ {∅, {∅}} ∧ (∅ = {∅} ∨ (∅ = ∅ ∧ 𝜑))))
2215, 21sylibr 134 . . . . . . . 8 (𝜑 → ∅ ∈ 𝐴)
23 eleq2 2295 . . . . . . . . 9 (𝑣 = ∅ → (∅ ∈ 𝑣 ↔ ∅ ∈ ∅))
2423rspcv 2906 . . . . . . . 8 (∅ ∈ 𝐴 → (∀𝑣𝐴 ∅ ∈ 𝑣 → ∅ ∈ ∅))
2522, 24syl 14 . . . . . . 7 (𝜑 → (∀𝑣𝐴 ∅ ∈ 𝑣 → ∅ ∈ ∅))
2625com12 30 . . . . . 6 (∀𝑣𝐴 ∅ ∈ 𝑣 → (𝜑 → ∅ ∈ ∅))
2710, 26mtoi 670 . . . . 5 (∀𝑣𝐴 ∅ ∈ 𝑣 → ¬ 𝜑)
289, 27syl 14 . . . 4 (((𝑢𝐴 ∧ ∀𝑣𝐴 𝑢𝑣) ∧ 𝑢 = {∅}) → ¬ 𝜑)
2928olcd 741 . . 3 (((𝑢𝐴 ∧ ∀𝑣𝐴 𝑢𝑣) ∧ 𝑢 = {∅}) → (𝜑 ∨ ¬ 𝜑))
30 simprr 533 . . . 4 (((𝑢𝐴 ∧ ∀𝑣𝐴 𝑢𝑣) ∧ (𝑢 = ∅ ∧ 𝜑)) → 𝜑)
3130orcd 740 . . 3 (((𝑢𝐴 ∧ ∀𝑣𝐴 𝑢𝑣) ∧ (𝑢 = ∅ ∧ 𝜑)) → (𝜑 ∨ ¬ 𝜑))
32 eqeq1 2238 . . . . . . 7 (𝑥 = 𝑢 → (𝑥 = {∅} ↔ 𝑢 = {∅}))
33 eqeq1 2238 . . . . . . . 8 (𝑥 = 𝑢 → (𝑥 = ∅ ↔ 𝑢 = ∅))
3433anbi1d 465 . . . . . . 7 (𝑥 = 𝑢 → ((𝑥 = ∅ ∧ 𝜑) ↔ (𝑢 = ∅ ∧ 𝜑)))
3532, 34orbi12d 800 . . . . . 6 (𝑥 = 𝑢 → ((𝑥 = {∅} ∨ (𝑥 = ∅ ∧ 𝜑)) ↔ (𝑢 = {∅} ∨ (𝑢 = ∅ ∧ 𝜑))))
3635, 20elrab2 2965 . . . . 5 (𝑢𝐴 ↔ (𝑢 ∈ {∅, {∅}} ∧ (𝑢 = {∅} ∨ (𝑢 = ∅ ∧ 𝜑))))
3736simprbi 275 . . . 4 (𝑢𝐴 → (𝑢 = {∅} ∨ (𝑢 = ∅ ∧ 𝜑)))
3837adantr 276 . . 3 ((𝑢𝐴 ∧ ∀𝑣𝐴 𝑢𝑣) → (𝑢 = {∅} ∨ (𝑢 = ∅ ∧ 𝜑)))
3929, 31, 38mpjaodan 805 . 2 ((𝑢𝐴 ∧ ∀𝑣𝐴 𝑢𝑣) → (𝜑 ∨ ¬ 𝜑))
4039rexlimiva 2645 1 (∃𝑢𝐴𝑣𝐴 𝑢𝑣 → (𝜑 ∨ ¬ 𝜑))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wb 105  wo 715   = wceq 1397  wcel 2202  wral 2510  wrex 2511  {crab 2514  wss 3200  c0 3494  {csn 3669  {cpr 3670
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-ext 2213  ax-nul 4215
This theorem depends on definitions:  df-bi 117  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-sn 3675  df-pr 3676
This theorem is referenced by:  reg2exmid  4634  reg3exmid  4678
  Copyright terms: Public domain W3C validator