ennnfonelemen - Intuitionistic Logic Explorer

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

Theorem ennnfonelemen 13043

Description: Lemma for ennnfone 13047. The result. (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	⊢ 𝐽 = (𝑥 ∈ ℕ₀ ↦ if(𝑥 = 0, ∅, (^◡𝑁‘(𝑥 − 1))))
ennnfonelemh.h	⊢ 𝐻 = seq0(𝐺, 𝐽)
ennnfone.l	⊢ 𝐿 = ∪ 𝑖 ∈ ℕ₀ (𝐻‘𝑖)

**Assertion**
Ref	Expression
ennnfonelemen	⊢ (𝜑 → 𝐴 ≈ ℕ)

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

**Proof of Theorem ennnfonelemen**
Step	Hyp	Ref	Expression
1		ennnfonelemh.dceq	. . . . . . 7 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
2		ennnfonelemh.f	. . . . . . 7 ⊢ (𝜑 → 𝐹:ω–onto→𝐴)
3		ennnfonelemh.ne	. . . . . . 7 ⊢ (𝜑 → ∀𝑛 ∈ ω ∃𝑘 ∈ ω ∀𝑗 ∈ suc 𝑛(𝐹‘𝑘) ≠ (𝐹‘𝑗))
4		ennnfonelemh.g	. . . . . . 7 ⊢ 𝐺 = (𝑥 ∈ (𝐴 ↑_pm ω), 𝑦 ∈ ω ↦ if((𝐹‘𝑦) ∈ (𝐹 “ 𝑦), 𝑥, (𝑥 ∪ {⟨dom 𝑥, (𝐹‘𝑦)⟩})))
5		ennnfonelemh.n	. . . . . . 7 ⊢ 𝑁 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)
6		ennnfonelemh.j	. . . . . . 7 ⊢ 𝐽 = (𝑥 ∈ ℕ₀ ↦ if(𝑥 = 0, ∅, (^◡𝑁‘(𝑥 − 1))))
7		ennnfonelemh.h	. . . . . . 7 ⊢ 𝐻 = seq0(𝐺, 𝐽)
8		ennnfone.l	. . . . . . 7 ⊢ 𝐿 = ∪ 𝑖 ∈ ℕ₀ (𝐻‘𝑖)
9	1, 2, 3, 4, 5, 6, 7, 8	ennnfonelemf1 13040	. . . . . 6 ⊢ (𝜑 → 𝐿:dom 𝐿–1-1→𝐴)
10	1, 2, 3, 4, 5, 6, 7, 8	ennnfonelemdm 13042	. . . . . . 7 ⊢ (𝜑 → dom 𝐿 = ω)
11		f1eq2 5538	. . . . . . 7 ⊢ (dom 𝐿 = ω → (𝐿:dom 𝐿–1-1→𝐴 ↔ 𝐿:ω–1-1→𝐴))
12	10, 11	syl 14	. . . . . 6 ⊢ (𝜑 → (𝐿:dom 𝐿–1-1→𝐴 ↔ 𝐿:ω–1-1→𝐴))
13	9, 12	mpbid 147	. . . . 5 ⊢ (𝜑 → 𝐿:ω–1-1→𝐴)
14	1, 2, 3, 4, 5, 6, 7, 8	ennnfonelemrn 13041	. . . . 5 ⊢ (𝜑 → ran 𝐿 = 𝐴)
15		dff1o5 5592	. . . . 5 ⊢ (𝐿:ω–1-1-onto→𝐴 ↔ (𝐿:ω–1-1→𝐴 ∧ ran 𝐿 = 𝐴))
16	13, 14, 15	sylanbrc 417	. . . 4 ⊢ (𝜑 → 𝐿:ω–1-1-onto→𝐴)
17		omex 4691	. . . . 5 ⊢ ω ∈ V
18	17	f1oen 6932	. . . 4 ⊢ (𝐿:ω–1-1-onto→𝐴 → ω ≈ 𝐴)
19	16, 18	syl 14	. . 3 ⊢ (𝜑 → ω ≈ 𝐴)
20	19	ensymd 6957	. 2 ⊢ (𝜑 → 𝐴 ≈ ω)
21		nnenom 10696	. . 3 ⊢ ℕ ≈ ω
22	21	ensymi 6956	. 2 ⊢ ω ≈ ℕ
23		entr 6958	. 2 ⊢ ((𝐴 ≈ ω ∧ ω ≈ ℕ) → 𝐴 ≈ ℕ)
24	20, 22, 23	sylancl 413	1 ⊢ (𝜑 → 𝐴 ≈ ℕ)

Colors of variables: wff set class

Syntax hints: → wi 4 ↔ wb 105 DECID wdc 841 = wceq 1397 ∈ wcel 2202 ≠ wne 2402 ∀wral 2510 ∃wrex 2511 ∪ cun 3198 ∅c0 3494 ifcif 3605 {csn 3669 ⟨cop 3672 ∪ ciun 3970 class class class wbr 4088 ↦ cmpt 4150 suc csuc 4462 ωcom 4688 ^◡ccnv 4724 dom cdm 4725 ran crn 4726 “ cima 4728 –1-1→wf1 5323 –onto→wfo 5324 –1-1-onto→wf1o 5325 ‘cfv 5326 (class class class)co 6018 ∈ cmpo 6020 freccfrec 6556 ↑_pm cpm 6818 ≈ cen 6907 0cc0 8032 1c1 8033 + caddc 8035 − cmin 8350 ℕcn 9143 ℕ₀cn0 9402 ℤcz 9479 seqcseq 10709

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 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-nul 4215 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-iinf 4686 ax-cnex 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-addcom 8132 ax-addass 8134 ax-distr 8136 ax-i2m1 8137 ax-0lt1 8138 ax-0id 8140 ax-rnegex 8141 ax-cnre 8143 ax-pre-ltirr 8144 ax-pre-ltwlin 8145 ax-pre-lttrn 8146 ax-pre-ltadd 8148

This theorem depends on definitions: df-bi 117 df-dc 842 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-if 3606 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-tr 4188 df-id 4390 df-iord 4463 df-on 4465 df-ilim 4466 df-suc 4468 df-iom 4689 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-riota 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-1st 6303 df-2nd 6304 df-recs 6471 df-frec 6557 df-er 6702 df-pm 6820 df-en 6910 df-pnf 8216 df-mnf 8217 df-xr 8218 df-ltxr 8219 df-le 8220 df-sub 8352 df-neg 8353 df-inn 9144 df-n0 9403 df-z 9480 df-uz 9756 df-seqfrec 10710

This theorem is referenced by: ennnfonelemnn0 13044

W3C validator