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

Theorem exmidssfi 7246
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 535 . . . . 5 ((EXMID ∧ (𝑥 ∈ Fin ∧ 𝑦𝑥)) → 𝑥 ∈ Fin)
2 simprr 537 . . . . 5 ((EXMID ∧ (𝑥 ∈ Fin ∧ 𝑦𝑥)) → 𝑦𝑥)
3 exmidexmid 4333 . . . . . . 7 (EXMIDDECID 𝑤𝑦)
43adantr 276 . . . . . 6 ((EXMID ∧ (𝑥 ∈ Fin ∧ 𝑦𝑥)) → DECID 𝑤𝑦)
54ralrimivw 2624 . . . . 5 ((EXMID ∧ (𝑥 ∈ Fin ∧ 𝑦𝑥)) → ∀𝑤𝑥 DECID 𝑤𝑦)
6 ssfidc 7245 . . . . 5 ((𝑥 ∈ Fin ∧ 𝑦𝑥 ∧ ∀𝑤𝑥 DECID 𝑤𝑦) → 𝑦 ∈ Fin)
71, 2, 5, 6syl3anc 1278 . . . 4 ((EXMID ∧ (𝑥 ∈ Fin ∧ 𝑦𝑥)) → 𝑦 ∈ Fin)
87ex 115 . . 3 (EXMID → ((𝑥 ∈ Fin ∧ 𝑦𝑥) → 𝑦 ∈ Fin))
98alrimivv 1928 . 2 (EXMID → ∀𝑥𝑦((𝑥 ∈ Fin ∧ 𝑦𝑥) → 𝑦 ∈ Fin))
10 ssfiexmidt 7180 . . . . 5 (∀𝑥𝑦((𝑥 ∈ Fin ∧ 𝑦𝑥) → 𝑦 ∈ Fin) → (𝑧 = {∅} ∨ ¬ 𝑧 = {∅}))
11 df-dc 847 . . . . 5 (DECID 𝑧 = {∅} ↔ (𝑧 = {∅} ∨ ¬ 𝑧 = {∅}))
1210, 11sylibr 134 . . . 4 (∀𝑥𝑦((𝑥 ∈ Fin ∧ 𝑦𝑥) → 𝑦 ∈ Fin) → DECID 𝑧 = {∅})
1312adantr 276 . . 3 ((∀𝑥𝑦((𝑥 ∈ Fin ∧ 𝑦𝑥) → 𝑦 ∈ Fin) ∧ 𝑧 ⊆ {∅}) → DECID 𝑧 = {∅})
1413exmid1dc 4337 . 2 (∀𝑥𝑦((𝑥 ∈ Fin ∧ 𝑦𝑥) → 𝑦 ∈ Fin) → EXMID)
159, 14impbii 126 1 (EXMID ↔ ∀𝑥𝑦((𝑥 ∈ Fin ∧ 𝑦𝑥) → 𝑦 ∈ Fin))
Colors of variables:    wff set class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wa 104  wb 105  wo 720  DECID wdc 846  wal 1400   = wceq 1402  wcel 2209  wral 2528  wss 3220  c0 3520  {csn 3709  EXMIDwem 4331  Fincfn 7022
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-exmid 4332  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-1o 6687  df-er 6807  df-en 7023  df-fin 7025
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator