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

Theorem ssfilem 7061
Description: Lemma for ssfiexmid 7062. (Contributed by Jim Kingdon, 3-Feb-2022.)
Hypothesis
Ref Expression
ssfilem.1 {𝑧 ∈ {∅} ∣ 𝜑} ∈ Fin
Assertion
Ref Expression
ssfilem (𝜑 ∨ ¬ 𝜑)
Distinct variable group:   𝜑,𝑧

Proof of Theorem ssfilem
Dummy variables 𝑛 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ssfilem.1 . . 3 {𝑧 ∈ {∅} ∣ 𝜑} ∈ Fin
2 isfi 6933 . . 3 ({𝑧 ∈ {∅} ∣ 𝜑} ∈ Fin ↔ ∃𝑛 ∈ ω {𝑧 ∈ {∅} ∣ 𝜑} ≈ 𝑛)
31, 2mpbi 145 . 2 𝑛 ∈ ω {𝑧 ∈ {∅} ∣ 𝜑} ≈ 𝑛
4 0elnn 4717 . . . . 5 (𝑛 ∈ ω → (𝑛 = ∅ ∨ ∅ ∈ 𝑛))
5 breq2 4092 . . . . . . . . . 10 (𝑛 = ∅ → ({𝑧 ∈ {∅} ∣ 𝜑} ≈ 𝑛 ↔ {𝑧 ∈ {∅} ∣ 𝜑} ≈ ∅))
6 en0 6968 . . . . . . . . . 10 ({𝑧 ∈ {∅} ∣ 𝜑} ≈ ∅ ↔ {𝑧 ∈ {∅} ∣ 𝜑} = ∅)
75, 6bitrdi 196 . . . . . . . . 9 (𝑛 = ∅ → ({𝑧 ∈ {∅} ∣ 𝜑} ≈ 𝑛 ↔ {𝑧 ∈ {∅} ∣ 𝜑} = ∅))
87biimpac 298 . . . . . . . 8 (({𝑧 ∈ {∅} ∣ 𝜑} ≈ 𝑛𝑛 = ∅) → {𝑧 ∈ {∅} ∣ 𝜑} = ∅)
9 rabeq0 3524 . . . . . . . . 9 ({𝑧 ∈ {∅} ∣ 𝜑} = ∅ ↔ ∀𝑧 ∈ {∅} ¬ 𝜑)
10 0ex 4216 . . . . . . . . . . 11 ∅ ∈ V
1110snm 3792 . . . . . . . . . 10 𝑤 𝑤 ∈ {∅}
12 r19.3rmv 3585 . . . . . . . . . 10 (∃𝑤 𝑤 ∈ {∅} → (¬ 𝜑 ↔ ∀𝑧 ∈ {∅} ¬ 𝜑))
1311, 12ax-mp 5 . . . . . . . . 9 𝜑 ↔ ∀𝑧 ∈ {∅} ¬ 𝜑)
149, 13bitr4i 187 . . . . . . . 8 ({𝑧 ∈ {∅} ∣ 𝜑} = ∅ ↔ ¬ 𝜑)
158, 14sylib 122 . . . . . . 7 (({𝑧 ∈ {∅} ∣ 𝜑} ≈ 𝑛𝑛 = ∅) → ¬ 𝜑)
1615olcd 741 . . . . . 6 (({𝑧 ∈ {∅} ∣ 𝜑} ≈ 𝑛𝑛 = ∅) → (𝜑 ∨ ¬ 𝜑))
17 ensym 6954 . . . . . . . 8 ({𝑧 ∈ {∅} ∣ 𝜑} ≈ 𝑛𝑛 ≈ {𝑧 ∈ {∅} ∣ 𝜑})
18 elex2 2819 . . . . . . . 8 (∅ ∈ 𝑛 → ∃𝑥 𝑥𝑛)
19 enm 7003 . . . . . . . 8 ((𝑛 ≈ {𝑧 ∈ {∅} ∣ 𝜑} ∧ ∃𝑥 𝑥𝑛) → ∃𝑦 𝑦 ∈ {𝑧 ∈ {∅} ∣ 𝜑})
2017, 18, 19syl2an 289 . . . . . . 7 (({𝑧 ∈ {∅} ∣ 𝜑} ≈ 𝑛 ∧ ∅ ∈ 𝑛) → ∃𝑦 𝑦 ∈ {𝑧 ∈ {∅} ∣ 𝜑})
21 biidd 172 . . . . . . . . . . 11 (𝑧 = 𝑦 → (𝜑𝜑))
2221elrab 2962 . . . . . . . . . 10 (𝑦 ∈ {𝑧 ∈ {∅} ∣ 𝜑} ↔ (𝑦 ∈ {∅} ∧ 𝜑))
2322simprbi 275 . . . . . . . . 9 (𝑦 ∈ {𝑧 ∈ {∅} ∣ 𝜑} → 𝜑)
2423orcd 740 . . . . . . . 8 (𝑦 ∈ {𝑧 ∈ {∅} ∣ 𝜑} → (𝜑 ∨ ¬ 𝜑))
2524exlimiv 1646 . . . . . . 7 (∃𝑦 𝑦 ∈ {𝑧 ∈ {∅} ∣ 𝜑} → (𝜑 ∨ ¬ 𝜑))
2620, 25syl 14 . . . . . 6 (({𝑧 ∈ {∅} ∣ 𝜑} ≈ 𝑛 ∧ ∅ ∈ 𝑛) → (𝜑 ∨ ¬ 𝜑))
2716, 26jaodan 804 . . . . 5 (({𝑧 ∈ {∅} ∣ 𝜑} ≈ 𝑛 ∧ (𝑛 = ∅ ∨ ∅ ∈ 𝑛)) → (𝜑 ∨ ¬ 𝜑))
284, 27sylan2 286 . . . 4 (({𝑧 ∈ {∅} ∣ 𝜑} ≈ 𝑛𝑛 ∈ ω) → (𝜑 ∨ ¬ 𝜑))
2928ancoms 268 . . 3 ((𝑛 ∈ ω ∧ {𝑧 ∈ {∅} ∣ 𝜑} ≈ 𝑛) → (𝜑 ∨ ¬ 𝜑))
3029rexlimiva 2645 . 2 (∃𝑛 ∈ ω {𝑧 ∈ {∅} ∣ 𝜑} ≈ 𝑛 → (𝜑 ∨ ¬ 𝜑))
313, 30ax-mp 5 1 (𝜑 ∨ ¬ 𝜑)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wa 104  wb 105  wo 715   = wceq 1397  wex 1540  wcel 2202  wral 2510  wrex 2511  {crab 2514  c0 3494  {csn 3669   class class class wbr 4088  ωcom 4688  cen 6906  Fincfn 6908
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-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-iinf 4686
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  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-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-id 4390  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-er 6701  df-en 6909  df-fin 6911
This theorem is referenced by:  ssfiexmid  7062  domfiexmid  7066
  Copyright terms: Public domain W3C validator