Theorem ennnfonelemr 13010

Description: Lemma for ennnfone 13012. The interesting direction, expressed in deduction form. (Contributed by Jim Kingdon, 27-Oct-2022.)

Hypotheses

Ref	Expression
ennnfonelemr.dceq	⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
ennnfonelemr.f	⊢ (𝜑 → 𝐹:ℕ0–onto→𝐴)
ennnfonelemr.n	⊢ (𝜑 → ∀𝑛 ∈ ℕ0 ∃𝑘 ∈ ℕ0 ∀𝑗 ∈ (0...𝑛)(𝐹‘𝑘) ≠ (𝐹‘𝑗))

Assertion

Ref	Expression
ennnfonelemr	⊢ (𝜑 → 𝐴 ≈ ℕ)

Distinct variable groups:   𝑦,𝐴,𝑥   𝑛,𝐹,𝑗,𝑘

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑗,𝑘,𝑛)   𝐴(𝑗,𝑘,𝑛)   𝐹(𝑥,𝑦)

Proof of Theorem ennnfonelemr

Dummy variables 𝑎 𝑏 𝑑 𝑒 𝑓 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ennnfonelemr.dceq	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
2		equequ1 1758	. . . . 5 ⊢ (𝑥 = 𝑎 → (𝑥 = 𝑦 ↔ 𝑎 = 𝑦))
3	2	dcbid 843	. . . 4 ⊢ (𝑥 = 𝑎 → (DECID 𝑥 = 𝑦 ↔ DECID 𝑎 = 𝑦))
4		equequ2 1759	. . . . 5 ⊢ (𝑦 = 𝑏 → (𝑎 = 𝑦 ↔ 𝑎 = 𝑏))
5	4	dcbid 843	. . . 4 ⊢ (𝑦 = 𝑏 → (DECID 𝑎 = 𝑦 ↔ DECID 𝑎 = 𝑏))
6	3, 5	cbvral2v 2778	. . 3 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ↔ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 DECID 𝑎 = 𝑏)
7	1, 6	sylib 122	. 2 ⊢ (𝜑 → ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 DECID 𝑎 = 𝑏)
8		ennnfonelemr.f	. 2 ⊢ (𝜑 → 𝐹:ℕ0–onto→𝐴)
9		ennnfonelemr.n	. . 3 ⊢ (𝜑 → ∀𝑛 ∈ ℕ0 ∃𝑘 ∈ ℕ0 ∀𝑗 ∈ (0...𝑛)(𝐹‘𝑘) ≠ (𝐹‘𝑗))
10		fveq2 5629	. . . . . . . . 9 ⊢ (𝑗 = 𝑓 → (𝐹‘𝑗) = (𝐹‘𝑓))
11	10	neeq2d 2419	. . . . . . . 8 ⊢ (𝑗 = 𝑓 → ((𝐹‘𝑘) ≠ (𝐹‘𝑗) ↔ (𝐹‘𝑘) ≠ (𝐹‘𝑓)))
12	11	cbvralv 2765	. . . . . . 7 ⊢ (∀𝑗 ∈ (0...𝑛)(𝐹‘𝑘) ≠ (𝐹‘𝑗) ↔ ∀𝑓 ∈ (0...𝑛)(𝐹‘𝑘) ≠ (𝐹‘𝑓))
13	12	rexbii 2537	. . . . . 6 ⊢ (∃𝑘 ∈ ℕ0 ∀𝑗 ∈ (0...𝑛)(𝐹‘𝑘) ≠ (𝐹‘𝑗) ↔ ∃𝑘 ∈ ℕ0 ∀𝑓 ∈ (0...𝑛)(𝐹‘𝑘) ≠ (𝐹‘𝑓))
14		fveq2 5629	. . . . . . . . 9 ⊢ (𝑘 = 𝑒 → (𝐹‘𝑘) = (𝐹‘𝑒))
15	14	neeq1d 2418	. . . . . . . 8 ⊢ (𝑘 = 𝑒 → ((𝐹‘𝑘) ≠ (𝐹‘𝑓) ↔ (𝐹‘𝑒) ≠ (𝐹‘𝑓)))
16	15	ralbidv 2530	. . . . . . 7 ⊢ (𝑘 = 𝑒 → (∀𝑓 ∈ (0...𝑛)(𝐹‘𝑘) ≠ (𝐹‘𝑓) ↔ ∀𝑓 ∈ (0...𝑛)(𝐹‘𝑒) ≠ (𝐹‘𝑓)))
17	16	cbvrexv 2766	. . . . . 6 ⊢ (∃𝑘 ∈ ℕ0 ∀𝑓 ∈ (0...𝑛)(𝐹‘𝑘) ≠ (𝐹‘𝑓) ↔ ∃𝑒 ∈ ℕ0 ∀𝑓 ∈ (0...𝑛)(𝐹‘𝑒) ≠ (𝐹‘𝑓))
18	13, 17	bitri 184	. . . . 5 ⊢ (∃𝑘 ∈ ℕ0 ∀𝑗 ∈ (0...𝑛)(𝐹‘𝑘) ≠ (𝐹‘𝑗) ↔ ∃𝑒 ∈ ℕ0 ∀𝑓 ∈ (0...𝑛)(𝐹‘𝑒) ≠ (𝐹‘𝑓))
19	18	ralbii 2536	. . . 4 ⊢ (∀𝑛 ∈ ℕ0 ∃𝑘 ∈ ℕ0 ∀𝑗 ∈ (0...𝑛)(𝐹‘𝑘) ≠ (𝐹‘𝑗) ↔ ∀𝑛 ∈ ℕ0 ∃𝑒 ∈ ℕ0 ∀𝑓 ∈ (0...𝑛)(𝐹‘𝑒) ≠ (𝐹‘𝑓))
20		oveq2 6015	. . . . . . 7 ⊢ (𝑛 = 𝑑 → (0...𝑛) = (0...𝑑))
21	20	raleqdv 2734	. . . . . 6 ⊢ (𝑛 = 𝑑 → (∀𝑓 ∈ (0...𝑛)(𝐹‘𝑒) ≠ (𝐹‘𝑓) ↔ ∀𝑓 ∈ (0...𝑑)(𝐹‘𝑒) ≠ (𝐹‘𝑓)))
22	21	rexbidv 2531	. . . . 5 ⊢ (𝑛 = 𝑑 → (∃𝑒 ∈ ℕ0 ∀𝑓 ∈ (0...𝑛)(𝐹‘𝑒) ≠ (𝐹‘𝑓) ↔ ∃𝑒 ∈ ℕ0 ∀𝑓 ∈ (0...𝑑)(𝐹‘𝑒) ≠ (𝐹‘𝑓)))
23	22	cbvralv 2765	. . . 4 ⊢ (∀𝑛 ∈ ℕ0 ∃𝑒 ∈ ℕ0 ∀𝑓 ∈ (0...𝑛)(𝐹‘𝑒) ≠ (𝐹‘𝑓) ↔ ∀𝑑 ∈ ℕ0 ∃𝑒 ∈ ℕ0 ∀𝑓 ∈ (0...𝑑)(𝐹‘𝑒) ≠ (𝐹‘𝑓))
24	19, 23	bitri 184	. . 3 ⊢ (∀𝑛 ∈ ℕ0 ∃𝑘 ∈ ℕ0 ∀𝑗 ∈ (0...𝑛)(𝐹‘𝑘) ≠ (𝐹‘𝑗) ↔ ∀𝑑 ∈ ℕ0 ∃𝑒 ∈ ℕ0 ∀𝑓 ∈ (0...𝑑)(𝐹‘𝑒) ≠ (𝐹‘𝑓))
25	9, 24	sylib 122	. 2 ⊢ (𝜑 → ∀𝑑 ∈ ℕ0 ∃𝑒 ∈ ℕ0 ∀𝑓 ∈ (0...𝑑)(𝐹‘𝑒) ≠ (𝐹‘𝑓))
26		oveq1 6014	. . . 4 ⊢ (𝑐 = 𝑎 → (𝑐 + 1) = (𝑎 + 1))
27	26	cbvmptv 4180	. . 3 ⊢ (𝑐 ∈ ℤ ↦ (𝑐 + 1)) = (𝑎 ∈ ℤ ↦ (𝑎 + 1))
28		freceq1 6544	. . 3 ⊢ ((𝑐 ∈ ℤ ↦ (𝑐 + 1)) = (𝑎 ∈ ℤ ↦ (𝑎 + 1)) → frec((𝑐 ∈ ℤ ↦ (𝑐 + 1)), 0) = frec((𝑎 ∈ ℤ ↦ (𝑎 + 1)), 0))
29	27, 28	ax-mp 5	. 2 ⊢ frec((𝑐 ∈ ℤ ↦ (𝑐 + 1)), 0) = frec((𝑎 ∈ ℤ ↦ (𝑎 + 1)), 0)
30	7, 8, 25, 29	ennnfonelemnn0 13009	1 ⊢ (𝜑 → 𝐴 ≈ ℕ)

Syntax hints:   → wi 4  DECID wdc 839   = wceq 1395   ≠ wne 2400  ∀wral 2508  ∃wrex 2509   class class class wbr 4083   ↦ cmpt 4145  –onto→wfo 5316  ‘cfv 5318  (class class class)co 6007  freccfrec 6542   ≈ cen 6893  0cc0 8010  1c1 8011   + caddc 8013  ℕcn 9121  ℕ₀cn0 9380  ℤcz 9457  ...cfz 10216

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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-iinf 4680  ax-cnex 8101  ax-resscn 8102  ax-1cn 8103  ax-1re 8104  ax-icn 8105  ax-addcl 8106  ax-addrcl 8107  ax-mulcl 8108  ax-addcom 8110  ax-addass 8112  ax-distr 8114  ax-i2m1 8115  ax-0lt1 8116  ax-0id 8118  ax-rnegex 8119  ax-cnre 8121  ax-pre-ltirr 8122  ax-pre-ltwlin 8123  ax-pre-lttrn 8124  ax-pre-ltadd 8126

This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-if 3603  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-tr 4183  df-id 4384  df-iord 4457  df-on 4459  df-ilim 4460  df-suc 4462  df-iom 4683  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-riota 5960  df-ov 6010  df-oprab 6011  df-mpo 6012  df-1st 6292  df-2nd 6293  df-recs 6457  df-frec 6543  df-er 6688  df-pm 6806  df-en 6896  df-pnf 8194  df-mnf 8195  df-xr 8196  df-ltxr 8197  df-le 8198  df-sub 8330  df-neg 8331  df-inn 9122  df-n0 9381  df-z 9458  df-uz 9734  df-fz 10217  df-seqfrec 10682

This theorem is referenced by:  ennnfone  13012