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

Theorem exmidssfi 7198
Description: Excluded middle is equivalent to any subset of a finite set being finite. Theorem 2.1 of [Bauer], p. 485. (Contributed by Jim Kingdon, 20-Mar-2026.)
Assertion
Ref Expression
exmidssfi (EXMID ↔ ∀𝑥𝑦((𝑥 ∈ Fin ∧ 𝑦𝑥) → 𝑦 ∈ Fin))
Distinct variable group:   𝑥,𝑦

Proof of Theorem exmidssfi
Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simprl 531 . . . . 5 ((EXMID ∧ (𝑥 ∈ Fin ∧ 𝑦𝑥)) → 𝑥 ∈ Fin)
2 simprr 533 . . . . 5 ((EXMID ∧ (𝑥 ∈ Fin ∧ 𝑦𝑥)) → 𝑦𝑥)
3 exmidexmid 4308 . . . . . . 7 (EXMIDDECID 𝑤𝑦)
43adantr 276 . . . . . 6 ((EXMID ∧ (𝑥 ∈ Fin ∧ 𝑦𝑥)) → DECID 𝑤𝑦)
54ralrimivw 2616 . . . . 5 ((EXMID ∧ (𝑥 ∈ Fin ∧ 𝑦𝑥)) → ∀𝑤𝑥 DECID 𝑤𝑦)
6 ssfidc 7197 . . . . 5 ((𝑥 ∈ Fin ∧ 𝑦𝑥 ∧ ∀𝑤𝑥 DECID 𝑤𝑦) → 𝑦 ∈ Fin)
71, 2, 5, 6syl3anc 1274 . . . 4 ((EXMID ∧ (𝑥 ∈ Fin ∧ 𝑦𝑥)) → 𝑦 ∈ Fin)
87ex 115 . . 3 (EXMID → ((𝑥 ∈ Fin ∧ 𝑦𝑥) → 𝑦 ∈ Fin))
98alrimivv 1924 . 2 (EXMID → ∀𝑥𝑦((𝑥 ∈ Fin ∧ 𝑦𝑥) → 𝑦 ∈ Fin))
10 ssfiexmidt 7132 . . . . 5 (∀𝑥𝑦((𝑥 ∈ Fin ∧ 𝑦𝑥) → 𝑦 ∈ Fin) → (𝑧 = {∅} ∨ ¬ 𝑧 = {∅}))
11 df-dc 843 . . . . 5 (DECID 𝑧 = {∅} ↔ (𝑧 = {∅} ∨ ¬ 𝑧 = {∅}))
1210, 11sylibr 134 . . . 4 (∀𝑥𝑦((𝑥 ∈ Fin ∧ 𝑦𝑥) → 𝑦 ∈ Fin) → DECID 𝑧 = {∅})
1312adantr 276 . . 3 ((∀𝑥𝑦((𝑥 ∈ Fin ∧ 𝑦𝑥) → 𝑦 ∈ Fin) ∧ 𝑧 ⊆ {∅}) → DECID 𝑧 = {∅})
1413exmid1dc 4312 . 2 (∀𝑥𝑦((𝑥 ∈ Fin ∧ 𝑦𝑥) → 𝑦 ∈ Fin) → EXMID)
159, 14impbii 126 1 (EXMID ↔ ∀𝑥𝑦((𝑥 ∈ Fin ∧ 𝑦𝑥) → 𝑦 ∈ Fin))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wb 105  wo 716  DECID wdc 842  wal 1396   = wceq 1398  wcel 2203  wral 2520  wss 3210  c0 3507  {csn 3688  EXMIDwem 4306  Fincfn 6974
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 2205  ax-14 2206  ax-ext 2214  ax-coll 4224  ax-sep 4227  ax-nul 4235  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-iinf 4709
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2814  df-sbc 3042  df-csb 3138  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-nul 3508  df-if 3620  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-iun 3992  df-br 4109  df-opab 4171  df-mpt 4172  df-tr 4208  df-exmid 4307  df-id 4413  df-iord 4486  df-on 4488  df-suc 4491  df-iom 4712  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-f1 5356  df-fo 5357  df-f1o 5358  df-fv 5359  df-1o 6646  df-er 6766  df-en 6975  df-fin 6977
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator