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

Theorem domfiexmid 7148
Description: If any set dominated by a finite set is finite, excluded middle follows. (Contributed by Jim Kingdon, 3-Feb-2022.)
Hypothesis
Ref Expression
domfiexmid.1 ((𝑥 ∈ Fin ∧ 𝑦𝑥) → 𝑦 ∈ Fin)
Assertion
Ref Expression
domfiexmid (𝜑 ∨ ¬ 𝜑)
Distinct variable groups:   𝜑,𝑦   𝑥,𝑦
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem domfiexmid
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 0ex 4242 . . . 4 ∅ ∈ V
2 snfig 7069 . . . 4 (∅ ∈ V → {∅} ∈ Fin)
31, 2ax-mp 5 . . 3 {∅} ∈ Fin
4 ssrab2 3327 . . . 4 {𝑧 ∈ {∅} ∣ 𝜑} ⊆ {∅}
5 ssdomg 7031 . . . 4 ({∅} ∈ Fin → ({𝑧 ∈ {∅} ∣ 𝜑} ⊆ {∅} → {𝑧 ∈ {∅} ∣ 𝜑} ≼ {∅}))
63, 4, 5mp2 16 . . 3 {𝑧 ∈ {∅} ∣ 𝜑} ≼ {∅}
7 domfiexmid.1 . . . . . 6 ((𝑥 ∈ Fin ∧ 𝑦𝑥) → 𝑦 ∈ Fin)
87gen2 1499 . . . . 5 𝑥𝑦((𝑥 ∈ Fin ∧ 𝑦𝑥) → 𝑦 ∈ Fin)
9 p0ex 4306 . . . . . 6 {∅} ∈ V
10 eleq1 2297 . . . . . . . . 9 (𝑥 = {∅} → (𝑥 ∈ Fin ↔ {∅} ∈ Fin))
11 breq2 4118 . . . . . . . . 9 (𝑥 = {∅} → (𝑦𝑥𝑦 ≼ {∅}))
1210, 11anbi12d 473 . . . . . . . 8 (𝑥 = {∅} → ((𝑥 ∈ Fin ∧ 𝑦𝑥) ↔ ({∅} ∈ Fin ∧ 𝑦 ≼ {∅})))
1312imbi1d 231 . . . . . . 7 (𝑥 = {∅} → (((𝑥 ∈ Fin ∧ 𝑦𝑥) → 𝑦 ∈ Fin) ↔ (({∅} ∈ Fin ∧ 𝑦 ≼ {∅}) → 𝑦 ∈ Fin)))
1413albidv 1873 . . . . . 6 (𝑥 = {∅} → (∀𝑦((𝑥 ∈ Fin ∧ 𝑦𝑥) → 𝑦 ∈ Fin) ↔ ∀𝑦(({∅} ∈ Fin ∧ 𝑦 ≼ {∅}) → 𝑦 ∈ Fin)))
159, 14spcv 2913 . . . . 5 (∀𝑥𝑦((𝑥 ∈ Fin ∧ 𝑦𝑥) → 𝑦 ∈ Fin) → ∀𝑦(({∅} ∈ Fin ∧ 𝑦 ≼ {∅}) → 𝑦 ∈ Fin))
168, 15ax-mp 5 . . . 4 𝑦(({∅} ∈ Fin ∧ 𝑦 ≼ {∅}) → 𝑦 ∈ Fin)
179rabex 4261 . . . . 5 {𝑧 ∈ {∅} ∣ 𝜑} ∈ V
18 breq1 4117 . . . . . . 7 (𝑦 = {𝑧 ∈ {∅} ∣ 𝜑} → (𝑦 ≼ {∅} ↔ {𝑧 ∈ {∅} ∣ 𝜑} ≼ {∅}))
1918anbi2d 464 . . . . . 6 (𝑦 = {𝑧 ∈ {∅} ∣ 𝜑} → (({∅} ∈ Fin ∧ 𝑦 ≼ {∅}) ↔ ({∅} ∈ Fin ∧ {𝑧 ∈ {∅} ∣ 𝜑} ≼ {∅})))
20 eleq1 2297 . . . . . 6 (𝑦 = {𝑧 ∈ {∅} ∣ 𝜑} → (𝑦 ∈ Fin ↔ {𝑧 ∈ {∅} ∣ 𝜑} ∈ Fin))
2119, 20imbi12d 234 . . . . 5 (𝑦 = {𝑧 ∈ {∅} ∣ 𝜑} → ((({∅} ∈ Fin ∧ 𝑦 ≼ {∅}) → 𝑦 ∈ Fin) ↔ (({∅} ∈ Fin ∧ {𝑧 ∈ {∅} ∣ 𝜑} ≼ {∅}) → {𝑧 ∈ {∅} ∣ 𝜑} ∈ Fin)))
2217, 21spcv 2913 . . . 4 (∀𝑦(({∅} ∈ Fin ∧ 𝑦 ≼ {∅}) → 𝑦 ∈ Fin) → (({∅} ∈ Fin ∧ {𝑧 ∈ {∅} ∣ 𝜑} ≼ {∅}) → {𝑧 ∈ {∅} ∣ 𝜑} ∈ Fin))
2316, 22ax-mp 5 . . 3 (({∅} ∈ Fin ∧ {𝑧 ∈ {∅} ∣ 𝜑} ≼ {∅}) → {𝑧 ∈ {∅} ∣ 𝜑} ∈ Fin)
243, 6, 23mp2an 426 . 2 {𝑧 ∈ {∅} ∣ 𝜑} ∈ Fin
2524ssfilem 7143 1 (𝜑 ∨ ¬ 𝜑)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wo 716  wal 1396   = wceq 1398  wcel 2205  {crab 2526  Vcvv 2815  wss 3214  c0 3512  {csn 3694   class class class wbr 4114  cdom 6987  Fincfn 6988
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-iinf 4715
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-sbc 3046  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-br 4115  df-opab 4177  df-id 4419  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-1o 6660  df-er 6780  df-en 6989  df-dom 6990  df-fin 6991
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator