Theorem ennnfonelemf1 13005

Description: Lemma for ennnfone 13012. 𝐿 is one-to-one. (Contributed by Jim Kingdon, 16-Jul-2023.)

Hypotheses

Ref	Expression
ennnfonelemh.dceq	⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
ennnfonelemh.f	⊢ (𝜑 → 𝐹:ω–onto→𝐴)
ennnfonelemh.ne	⊢ (𝜑 → ∀𝑛 ∈ ω ∃𝑘 ∈ ω ∀𝑗 ∈ suc 𝑛(𝐹‘𝑘) ≠ (𝐹‘𝑗))
ennnfonelemh.g	⊢ 𝐺 = (𝑥 ∈ (𝐴 ↑pm ω), 𝑦 ∈ ω ↦ if((𝐹‘𝑦) ∈ (𝐹 “ 𝑦), 𝑥, (𝑥 ∪ {⟨dom 𝑥, (𝐹‘𝑦)⟩})))
ennnfonelemh.n	⊢ 𝑁 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)
ennnfonelemh.j	⊢ 𝐽 = (𝑥 ∈ ℕ0 ↦ if(𝑥 = 0, ∅, (◡𝑁‘(𝑥 − 1))))
ennnfonelemh.h	⊢ 𝐻 = seq0(𝐺, 𝐽)
ennnfone.l	⊢ 𝐿 = ∪ 𝑖 ∈ ℕ0 (𝐻‘𝑖)

Assertion

Ref	Expression
ennnfonelemf1	⊢ (𝜑 → 𝐿:dom 𝐿–1-1→𝐴)

Distinct variable groups:   𝐴,𝑗,𝑥,𝑦   𝑥,𝐹,𝑦,𝑗,𝑘   𝑛,𝐹   𝑗,𝐺   𝑖,𝐻   𝑗,𝐻,𝑥,𝑦,𝑘   𝑗,𝐽   𝑥,𝑁,𝑦,𝑘,𝑗   𝜑,𝑗,𝑥,𝑦,𝑘   𝑘,𝑛,𝑗

Allowed substitution hints:   𝜑(𝑖,𝑛)   𝐴(𝑖,𝑘,𝑛)   𝐹(𝑖)   𝐺(𝑥,𝑦,𝑖,𝑘,𝑛)   𝐻(𝑛)   𝐽(𝑥,𝑦,𝑖,𝑘,𝑛)   𝐿(𝑥,𝑦,𝑖,𝑗,𝑘,𝑛)   𝑁(𝑖,𝑛)

Proof of Theorem ennnfonelemf1

Dummy variables 𝑞 𝑠 𝑡 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ennnfonelemh.dceq	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
2		ennnfonelemh.f	. . . . 5 ⊢ (𝜑 → 𝐹:ω–onto→𝐴)
3		ennnfonelemh.ne	. . . . 5 ⊢ (𝜑 → ∀𝑛 ∈ ω ∃𝑘 ∈ ω ∀𝑗 ∈ suc 𝑛(𝐹‘𝑘) ≠ (𝐹‘𝑗))
4		ennnfonelemh.g	. . . . 5 ⊢ 𝐺 = (𝑥 ∈ (𝐴 ↑pm ω), 𝑦 ∈ ω ↦ if((𝐹‘𝑦) ∈ (𝐹 “ 𝑦), 𝑥, (𝑥 ∪ {⟨dom 𝑥, (𝐹‘𝑦)⟩})))
5		ennnfonelemh.n	. . . . 5 ⊢ 𝑁 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)
6		ennnfonelemh.j	. . . . 5 ⊢ 𝐽 = (𝑥 ∈ ℕ0 ↦ if(𝑥 = 0, ∅, (◡𝑁‘(𝑥 − 1))))
7		ennnfonelemh.h	. . . . 5 ⊢ 𝐻 = seq0(𝐺, 𝐽)
8		ennnfone.l	. . . . 5 ⊢ 𝐿 = ∪ 𝑖 ∈ ℕ0 (𝐻‘𝑖)
9	1, 2, 3, 4, 5, 6, 7, 8	ennnfonelemfun 13004	. . . 4 ⊢ (𝜑 → Fun 𝐿)
10	9	funfnd 5349	. . 3 ⊢ (𝜑 → 𝐿 Fn dom 𝐿)
11	1, 2, 3, 4, 5, 6, 7	ennnfonelemh 12991	. . . . . . . . 9 ⊢ (𝜑 → 𝐻:ℕ0⟶(𝐴 ↑pm ω))
12	11	ffnd 5474	. . . . . . . 8 ⊢ (𝜑 → 𝐻 Fn ℕ0)
13		fniunfv 5892	. . . . . . . 8 ⊢ (𝐻 Fn ℕ0 → ∪ 𝑖 ∈ ℕ0 (𝐻‘𝑖) = ∪ ran 𝐻)
14	12, 13	syl 14	. . . . . . 7 ⊢ (𝜑 → ∪ 𝑖 ∈ ℕ0 (𝐻‘𝑖) = ∪ ran 𝐻)
15	8, 14	eqtrid 2274	. . . . . 6 ⊢ (𝜑 → 𝐿 = ∪ ran 𝐻)
16	15	rneqd 4953	. . . . 5 ⊢ (𝜑 → ran 𝐿 = ran ∪ ran 𝐻)
17		rnuni 5140	. . . . 5 ⊢ ran ∪ ran 𝐻 = ∪ 𝑥 ∈ ran 𝐻ran 𝑥
18	16, 17	eqtrdi 2278	. . . 4 ⊢ (𝜑 → ran 𝐿 = ∪ 𝑥 ∈ ran 𝐻ran 𝑥)
19	11	frnd 5483	. . . . . . . . . 10 ⊢ (𝜑 → ran 𝐻 ⊆ (𝐴 ↑pm ω))
20	19	sselda 3224	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ran 𝐻) → 𝑥 ∈ (𝐴 ↑pm ω))
21		elpmi 6822	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐴 ↑pm ω) → (𝑥:dom 𝑥⟶𝐴 ∧ dom 𝑥 ⊆ ω))
22	20, 21	syl 14	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ran 𝐻) → (𝑥:dom 𝑥⟶𝐴 ∧ dom 𝑥 ⊆ ω))
23	22	simpld 112	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ran 𝐻) → 𝑥:dom 𝑥⟶𝐴)
24	23	frnd 5483	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ran 𝐻) → ran 𝑥 ⊆ 𝐴)
25	24	ralrimiva 2603	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ ran 𝐻ran 𝑥 ⊆ 𝐴)
26		iunss 4006	. . . . 5 ⊢ (∪ 𝑥 ∈ ran 𝐻ran 𝑥 ⊆ 𝐴 ↔ ∀𝑥 ∈ ran 𝐻ran 𝑥 ⊆ 𝐴)
27	25, 26	sylibr 134	. . . 4 ⊢ (𝜑 → ∪ 𝑥 ∈ ran 𝐻ran 𝑥 ⊆ 𝐴)
28	18, 27	eqsstrd 3260	. . 3 ⊢ (𝜑 → ran 𝐿 ⊆ 𝐴)
29		df-f 5322	. . 3 ⊢ (𝐿:dom 𝐿⟶𝐴 ↔ (𝐿 Fn dom 𝐿 ∧ ran 𝐿 ⊆ 𝐴))
30	10, 28, 29	sylanbrc 417	. 2 ⊢ (𝜑 → 𝐿:dom 𝐿⟶𝐴)
31	19	sselda 3224	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ ran 𝐻) → 𝑠 ∈ (𝐴 ↑pm ω))
32		pmfun 6823	. . . . . . . 8 ⊢ (𝑠 ∈ (𝐴 ↑pm ω) → Fun 𝑠)
33	31, 32	syl 14	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ ran 𝐻) → Fun 𝑠)
34	11	ffund 5477	. . . . . . . . . 10 ⊢ (𝜑 → Fun 𝐻)
35	34	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ ran 𝐻) → Fun 𝐻)
36		simpr 110	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ ran 𝐻) → 𝑠 ∈ ran 𝐻)
37		elrnrexdm 5776	. . . . . . . . 9 ⊢ (Fun 𝐻 → (𝑠 ∈ ran 𝐻 → ∃𝑞 ∈ dom 𝐻 𝑠 = (𝐻‘𝑞)))
38	35, 36, 37	sylc 62	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ ran 𝐻) → ∃𝑞 ∈ dom 𝐻 𝑠 = (𝐻‘𝑞))
39	1	adantr 276	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑞 ∈ dom 𝐻) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
40	2	adantr 276	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑞 ∈ dom 𝐻) → 𝐹:ω–onto→𝐴)
41	3	adantr 276	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑞 ∈ dom 𝐻) → ∀𝑛 ∈ ω ∃𝑘 ∈ ω ∀𝑗 ∈ suc 𝑛(𝐹‘𝑘) ≠ (𝐹‘𝑗))
42	11	fdmd 5480	. . . . . . . . . . . . . 14 ⊢ (𝜑 → dom 𝐻 = ℕ0)
43	42	eleq2d 2299	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑞 ∈ dom 𝐻 ↔ 𝑞 ∈ ℕ0))
44	43	biimpa 296	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑞 ∈ dom 𝐻) → 𝑞 ∈ ℕ0)
45	39, 40, 41, 4, 5, 6, 7, 44	ennnfonelemhf1o 13000	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑞 ∈ dom 𝐻) → (𝐻‘𝑞):dom (𝐻‘𝑞)–1-1-onto→(𝐹 “ (◡𝑁‘𝑞)))
46		f1ocnv 5587	. . . . . . . . . . 11 ⊢ ((𝐻‘𝑞):dom (𝐻‘𝑞)–1-1-onto→(𝐹 “ (◡𝑁‘𝑞)) → ◡(𝐻‘𝑞):(𝐹 “ (◡𝑁‘𝑞))–1-1-onto→dom (𝐻‘𝑞))
47		f1ofun 5576	. . . . . . . . . . 11 ⊢ (◡(𝐻‘𝑞):(𝐹 “ (◡𝑁‘𝑞))–1-1-onto→dom (𝐻‘𝑞) → Fun ◡(𝐻‘𝑞))
48	45, 46, 47	3syl 17	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑞 ∈ dom 𝐻) → Fun ◡(𝐻‘𝑞))
49	48	ad2ant2r 509	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑠 ∈ ran 𝐻) ∧ (𝑞 ∈ dom 𝐻 ∧ 𝑠 = (𝐻‘𝑞))) → Fun ◡(𝐻‘𝑞))
50		simprr 531	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑠 ∈ ran 𝐻) ∧ (𝑞 ∈ dom 𝐻 ∧ 𝑠 = (𝐻‘𝑞))) → 𝑠 = (𝐻‘𝑞))
51	50	cnveqd 4898	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑠 ∈ ran 𝐻) ∧ (𝑞 ∈ dom 𝐻 ∧ 𝑠 = (𝐻‘𝑞))) → ◡𝑠 = ◡(𝐻‘𝑞))
52	51	funeqd 5340	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑠 ∈ ran 𝐻) ∧ (𝑞 ∈ dom 𝐻 ∧ 𝑠 = (𝐻‘𝑞))) → (Fun ◡𝑠 ↔ Fun ◡(𝐻‘𝑞)))
53	49, 52	mpbird 167	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑠 ∈ ran 𝐻) ∧ (𝑞 ∈ dom 𝐻 ∧ 𝑠 = (𝐻‘𝑞))) → Fun ◡𝑠)
54	38, 53	rexlimddv 2653	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ ran 𝐻) → Fun ◡𝑠)
55	1	ad2antrr 488	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑠 ∈ ran 𝐻) ∧ 𝑡 ∈ ran 𝐻) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
56	2	ad2antrr 488	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑠 ∈ ran 𝐻) ∧ 𝑡 ∈ ran 𝐻) → 𝐹:ω–onto→𝐴)
57	3	ad2antrr 488	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑠 ∈ ran 𝐻) ∧ 𝑡 ∈ ran 𝐻) → ∀𝑛 ∈ ω ∃𝑘 ∈ ω ∀𝑗 ∈ suc 𝑛(𝐹‘𝑘) ≠ (𝐹‘𝑗))
58		simplr 528	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑠 ∈ ran 𝐻) ∧ 𝑡 ∈ ran 𝐻) → 𝑠 ∈ ran 𝐻)
59		simpr 110	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑠 ∈ ran 𝐻) ∧ 𝑡 ∈ ran 𝐻) → 𝑡 ∈ ran 𝐻)
60	55, 56, 57, 4, 5, 6, 7, 58, 59	ennnfonelemrnh 13003	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑠 ∈ ran 𝐻) ∧ 𝑡 ∈ ran 𝐻) → (𝑠 ⊆ 𝑡 ∨ 𝑡 ⊆ 𝑠))
61	60	ralrimiva 2603	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ ran 𝐻) → ∀𝑡 ∈ ran 𝐻(𝑠 ⊆ 𝑡 ∨ 𝑡 ⊆ 𝑠))
62	33, 54, 61	jca31 309	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ ran 𝐻) → ((Fun 𝑠 ∧ Fun ◡𝑠) ∧ ∀𝑡 ∈ ran 𝐻(𝑠 ⊆ 𝑡 ∨ 𝑡 ⊆ 𝑠)))
63	62	ralrimiva 2603	. . . . 5 ⊢ (𝜑 → ∀𝑠 ∈ ran 𝐻((Fun 𝑠 ∧ Fun ◡𝑠) ∧ ∀𝑡 ∈ ran 𝐻(𝑠 ⊆ 𝑡 ∨ 𝑡 ⊆ 𝑠)))
64		fun11uni 5391	. . . . 5 ⊢ (∀𝑠 ∈ ran 𝐻((Fun 𝑠 ∧ Fun ◡𝑠) ∧ ∀𝑡 ∈ ran 𝐻(𝑠 ⊆ 𝑡 ∨ 𝑡 ⊆ 𝑠)) → (Fun ∪ ran 𝐻 ∧ Fun ◡∪ ran 𝐻))
65	63, 64	syl 14	. . . 4 ⊢ (𝜑 → (Fun ∪ ran 𝐻 ∧ Fun ◡∪ ran 𝐻))
66	65	simprd 114	. . 3 ⊢ (𝜑 → Fun ◡∪ ran 𝐻)
67	15	cnveqd 4898	. . . 4 ⊢ (𝜑 → ◡𝐿 = ◡∪ ran 𝐻)
68	67	funeqd 5340	. . 3 ⊢ (𝜑 → (Fun ◡𝐿 ↔ Fun ◡∪ ran 𝐻))
69	66, 68	mpbird 167	. 2 ⊢ (𝜑 → Fun ◡𝐿)
70		df-f1 5323	. 2 ⊢ (𝐿:dom 𝐿–1-1→𝐴 ↔ (𝐿:dom 𝐿⟶𝐴 ∧ Fun ◡𝐿))
71	30, 69, 70	sylanbrc 417	1 ⊢ (𝜑 → 𝐿:dom 𝐿–1-1→𝐴)

Syntax hints:   → wi 4   ∧ wa 104   ∨ wo 713  DECID wdc 839   = wceq 1395   ∈ wcel 2200   ≠ wne 2400  ∀wral 2508  ∃wrex 2509   ∪ cun 3195   ⊆ wss 3197  ∅c0 3491  ifcif 3602  {csn 3666  ⟨cop 3669  ∪ cuni 3888  ∪ ciun 3965   ↦ cmpt 4145  suc csuc 4456  ωcom 4682  ^◡ccnv 4718  dom cdm 4719  ran crn 4720   “ cima 4722  Fun wfun 5312   Fn wfn 5313  ⟶wf 5314  –1-1→wf1 5315  –onto→wfo 5316  –1-1-onto→wf1o 5317  ‘cfv 5318  (class class class)co 6007   ∈ cmpo 6009  freccfrec 6542   ↑_pm cpm 6804  0cc0 8010  1c1 8011   + caddc 8013   − cmin 8328  ℕ₀cn0 9380  ℤcz 9457  seqcseq 10681

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-pm 6806  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-seqfrec 10682

This theorem is referenced by:  ennnfonelemrn  13006  ennnfonelemen  13008