Theorem ennnfonelemr 12794

Description: Lemma for ennnfone 12796. 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 1735	. . . . 5 ⊢ (𝑥 = 𝑎 → (𝑥 = 𝑦 ↔ 𝑎 = 𝑦))
3	2	dcbid 840	. . . 4 ⊢ (𝑥 = 𝑎 → (DECID 𝑥 = 𝑦 ↔ DECID 𝑎 = 𝑦))
4		equequ2 1736	. . . . 5 ⊢ (𝑦 = 𝑏 → (𝑎 = 𝑦 ↔ 𝑎 = 𝑏))
5	4	dcbid 840	. . . 4 ⊢ (𝑦 = 𝑏 → (DECID 𝑎 = 𝑦 ↔ DECID 𝑎 = 𝑏))
6	3, 5	cbvral2v 2751	. . 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 5576	. . . . . . . . 9 ⊢ (𝑗 = 𝑓 → (𝐹‘𝑗) = (𝐹‘𝑓))
11	10	neeq2d 2395	. . . . . . . 8 ⊢ (𝑗 = 𝑓 → ((𝐹‘𝑘) ≠ (𝐹‘𝑗) ↔ (𝐹‘𝑘) ≠ (𝐹‘𝑓)))
12	11	cbvralv 2738	. . . . . . 7 ⊢ (∀𝑗 ∈ (0...𝑛)(𝐹‘𝑘) ≠ (𝐹‘𝑗) ↔ ∀𝑓 ∈ (0...𝑛)(𝐹‘𝑘) ≠ (𝐹‘𝑓))
13	12	rexbii 2513	. . . . . 6 ⊢ (∃𝑘 ∈ ℕ0 ∀𝑗 ∈ (0...𝑛)(𝐹‘𝑘) ≠ (𝐹‘𝑗) ↔ ∃𝑘 ∈ ℕ0 ∀𝑓 ∈ (0...𝑛)(𝐹‘𝑘) ≠ (𝐹‘𝑓))
14		fveq2 5576	. . . . . . . . 9 ⊢ (𝑘 = 𝑒 → (𝐹‘𝑘) = (𝐹‘𝑒))
15	14	neeq1d 2394	. . . . . . . 8 ⊢ (𝑘 = 𝑒 → ((𝐹‘𝑘) ≠ (𝐹‘𝑓) ↔ (𝐹‘𝑒) ≠ (𝐹‘𝑓)))
16	15	ralbidv 2506	. . . . . . 7 ⊢ (𝑘 = 𝑒 → (∀𝑓 ∈ (0...𝑛)(𝐹‘𝑘) ≠ (𝐹‘𝑓) ↔ ∀𝑓 ∈ (0...𝑛)(𝐹‘𝑒) ≠ (𝐹‘𝑓)))
17	16	cbvrexv 2739	. . . . . 6 ⊢ (∃𝑘 ∈ ℕ0 ∀𝑓 ∈ (0...𝑛)(𝐹‘𝑘) ≠ (𝐹‘𝑓) ↔ ∃𝑒 ∈ ℕ0 ∀𝑓 ∈ (0...𝑛)(𝐹‘𝑒) ≠ (𝐹‘𝑓))
18	13, 17	bitri 184	. . . . 5 ⊢ (∃𝑘 ∈ ℕ0 ∀𝑗 ∈ (0...𝑛)(𝐹‘𝑘) ≠ (𝐹‘𝑗) ↔ ∃𝑒 ∈ ℕ0 ∀𝑓 ∈ (0...𝑛)(𝐹‘𝑒) ≠ (𝐹‘𝑓))
19	18	ralbii 2512	. . . 4 ⊢ (∀𝑛 ∈ ℕ0 ∃𝑘 ∈ ℕ0 ∀𝑗 ∈ (0...𝑛)(𝐹‘𝑘) ≠ (𝐹‘𝑗) ↔ ∀𝑛 ∈ ℕ0 ∃𝑒 ∈ ℕ0 ∀𝑓 ∈ (0...𝑛)(𝐹‘𝑒) ≠ (𝐹‘𝑓))
20		oveq2 5952	. . . . . . 7 ⊢ (𝑛 = 𝑑 → (0...𝑛) = (0...𝑑))
21	20	raleqdv 2708	. . . . . 6 ⊢ (𝑛 = 𝑑 → (∀𝑓 ∈ (0...𝑛)(𝐹‘𝑒) ≠ (𝐹‘𝑓) ↔ ∀𝑓 ∈ (0...𝑑)(𝐹‘𝑒) ≠ (𝐹‘𝑓)))
22	21	rexbidv 2507	. . . . 5 ⊢ (𝑛 = 𝑑 → (∃𝑒 ∈ ℕ0 ∀𝑓 ∈ (0...𝑛)(𝐹‘𝑒) ≠ (𝐹‘𝑓) ↔ ∃𝑒 ∈ ℕ0 ∀𝑓 ∈ (0...𝑑)(𝐹‘𝑒) ≠ (𝐹‘𝑓)))
23	22	cbvralv 2738	. . . 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 5951	. . . 4 ⊢ (𝑐 = 𝑎 → (𝑐 + 1) = (𝑎 + 1))
27	26	cbvmptv 4140	. . 3 ⊢ (𝑐 ∈ ℤ ↦ (𝑐 + 1)) = (𝑎 ∈ ℤ ↦ (𝑎 + 1))
28		freceq1 6478	. . 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 12793	1 ⊢ (𝜑 → 𝐴 ≈ ℕ)

Syntax hints:   → wi 4  DECID wdc 836   = wceq 1373   ≠ wne 2376  ∀wral 2484  ∃wrex 2485   class class class wbr 4044   ↦ cmpt 4105  –onto→wfo 5269  ‘cfv 5271  (class class class)co 5944  freccfrec 6476   ≈ cen 6825  0cc0 7925  1c1 7926   + caddc 7928  ℕcn 9036  ℕ₀cn0 9295  ℤcz 9372  ...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:  ennnfone  12796