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

Theorem ennnfone 12796
Description: A condition for a set being countably infinite. Corollary 8.1.13 of [AczelRathjen], p. 73. Roughly speaking, the condition says that 𝐴 is countable (that's the 𝑓:ℕ0onto𝐴 part, as seen in theorems like ctm 7211), infinite (that's the part about being able to find an element of 𝐴 distinct from any mapping of a natural number via 𝑓), and has decidable equality. (Contributed by Jim Kingdon, 27-Oct-2022.)
Assertion
Ref Expression
ennnfone (𝐴 ≈ ℕ ↔ (∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦 ∧ ∃𝑓(𝑓:ℕ0onto𝐴 ∧ ∀𝑛 ∈ ℕ0𝑘 ∈ ℕ0𝑗 ∈ (0...𝑛)(𝑓𝑘) ≠ (𝑓𝑗))))
Distinct variable groups:   𝐴,𝑓,𝑗,𝑛,𝑥,𝑦   𝑓,𝑘,𝑗,𝑛
Allowed substitution hint:   𝐴(𝑘)

Proof of Theorem ennnfone
StepHypRef Expression
1 ennnfonelemim 12795 . 2 (𝐴 ≈ ℕ → (∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦 ∧ ∃𝑓(𝑓:ℕ0onto𝐴 ∧ ∀𝑛 ∈ ℕ0𝑘 ∈ ℕ0𝑗 ∈ (0...𝑛)(𝑓𝑘) ≠ (𝑓𝑗))))
2 simpl 109 . . . . . 6 ((∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦 ∧ (𝑓:ℕ0onto𝐴 ∧ ∀𝑛 ∈ ℕ0𝑘 ∈ ℕ0𝑗 ∈ (0...𝑛)(𝑓𝑘) ≠ (𝑓𝑗))) → ∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦)
3 simprl 529 . . . . . 6 ((∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦 ∧ (𝑓:ℕ0onto𝐴 ∧ ∀𝑛 ∈ ℕ0𝑘 ∈ ℕ0𝑗 ∈ (0...𝑛)(𝑓𝑘) ≠ (𝑓𝑗))) → 𝑓:ℕ0onto𝐴)
4 simprr 531 . . . . . 6 ((∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦 ∧ (𝑓:ℕ0onto𝐴 ∧ ∀𝑛 ∈ ℕ0𝑘 ∈ ℕ0𝑗 ∈ (0...𝑛)(𝑓𝑘) ≠ (𝑓𝑗))) → ∀𝑛 ∈ ℕ0𝑘 ∈ ℕ0𝑗 ∈ (0...𝑛)(𝑓𝑘) ≠ (𝑓𝑗))
52, 3, 4ennnfonelemr 12794 . . . . 5 ((∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦 ∧ (𝑓:ℕ0onto𝐴 ∧ ∀𝑛 ∈ ℕ0𝑘 ∈ ℕ0𝑗 ∈ (0...𝑛)(𝑓𝑘) ≠ (𝑓𝑗))) → 𝐴 ≈ ℕ)
65ex 115 . . . 4 (∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦 → ((𝑓:ℕ0onto𝐴 ∧ ∀𝑛 ∈ ℕ0𝑘 ∈ ℕ0𝑗 ∈ (0...𝑛)(𝑓𝑘) ≠ (𝑓𝑗)) → 𝐴 ≈ ℕ))
76exlimdv 1842 . . 3 (∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦 → (∃𝑓(𝑓:ℕ0onto𝐴 ∧ ∀𝑛 ∈ ℕ0𝑘 ∈ ℕ0𝑗 ∈ (0...𝑛)(𝑓𝑘) ≠ (𝑓𝑗)) → 𝐴 ≈ ℕ))
87imp 124 . 2 ((∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦 ∧ ∃𝑓(𝑓:ℕ0onto𝐴 ∧ ∀𝑛 ∈ ℕ0𝑘 ∈ ℕ0𝑗 ∈ (0...𝑛)(𝑓𝑘) ≠ (𝑓𝑗))) → 𝐴 ≈ ℕ)
91, 8impbii 126 1 (𝐴 ≈ ℕ ↔ (∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦 ∧ ∃𝑓(𝑓:ℕ0onto𝐴 ∧ ∀𝑛 ∈ ℕ0𝑘 ∈ ℕ0𝑗 ∈ (0...𝑛)(𝑓𝑘) ≠ (𝑓𝑗))))
Colors of variables: wff set class
Syntax hints:  wa 104  wb 105  DECID wdc 836  wex 1515  wne 2376  wral 2484  wrex 2485   class class class wbr 4044  ontowfo 5269  cfv 5271  (class class class)co 5944  cen 6825  0cc0 7925  cn 9036  0cn0 9295  ...cfz 10130
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 615  ax-in2 616  ax-io 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-13 2178  ax-14 2179  ax-ext 2187  ax-coll 4159  ax-sep 4162  ax-nul 4170  ax-pow 4218  ax-pr 4253  ax-un 4480  ax-setind 4585  ax-iinf 4636  ax-cnex 8016  ax-resscn 8017  ax-1cn 8018  ax-1re 8019  ax-icn 8020  ax-addcl 8021  ax-addrcl 8022  ax-mulcl 8023  ax-addcom 8025  ax-addass 8027  ax-distr 8029  ax-i2m1 8030  ax-0lt1 8031  ax-0id 8033  ax-rnegex 8034  ax-cnre 8036  ax-pre-ltirr 8037  ax-pre-ltwlin 8038  ax-pre-lttrn 8039  ax-pre-ltadd 8041
This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ne 2377  df-nel 2472  df-ral 2489  df-rex 2490  df-reu 2491  df-rab 2493  df-v 2774  df-sbc 2999  df-csb 3094  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3461  df-if 3572  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-int 3886  df-iun 3929  df-br 4045  df-opab 4106  df-mpt 4107  df-tr 4143  df-id 4340  df-iord 4413  df-on 4415  df-ilim 4416  df-suc 4418  df-iom 4639  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-rn 4686  df-res 4687  df-ima 4688  df-iota 5232  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279  df-riota 5899  df-ov 5947  df-oprab 5948  df-mpo 5949  df-1st 6226  df-2nd 6227  df-recs 6391  df-frec 6477  df-er 6620  df-pm 6738  df-en 6828  df-pnf 8109  df-mnf 8110  df-xr 8111  df-ltxr 8112  df-le 8113  df-sub 8245  df-neg 8246  df-inn 9037  df-n0 9296  df-z 9373  df-uz 9649  df-fz 10131  df-seqfrec 10593
This theorem is referenced by:  ctinfom  12799
  Copyright terms: Public domain W3C validator