ennnfonelemen - Intuitionistic Logic Explorer

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

Theorem ennnfonelemen 13032

Description: Lemma for ennnfone 13036. 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 13029	. . . . . 6 ⊢ (𝜑 → 𝐿:dom 𝐿–1-1→𝐴)
10	1, 2, 3, 4, 5, 6, 7, 8	ennnfonelemdm 13031	. . . . . . 7 ⊢ (𝜑 → dom 𝐿 = ω)
11		f1eq2 5535	. . . . . . 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 13030	. . . . 5 ⊢ (𝜑 → ran 𝐿 = 𝐴)
15		dff1o5 5589	. . . . 5 ⊢ (𝐿:ω–1-1-onto→𝐴 ↔ (𝐿:ω–1-1→𝐴 ∧ ran 𝐿 = 𝐴))
16	13, 14, 15	sylanbrc 417	. . . 4 ⊢ (𝜑 → 𝐿:ω–1-1-onto→𝐴)
17		omex 4689	. . . . 5 ⊢ ω ∈ V
18	17	f1oen 6927	. . . 4 ⊢ (𝐿:ω–1-1-onto→𝐴 → ω ≈ 𝐴)
19	16, 18	syl 14	. . 3 ⊢ (𝜑 → ω ≈ 𝐴)
20	19	ensymd 6952	. 2 ⊢ (𝜑 → 𝐴 ≈ ω)
21		nnenom 10686	. . 3 ⊢ ℕ ≈ ω
22	21	ensymi 6951	. 2 ⊢ ω ≈ ℕ
23		entr 6953	. 2 ⊢ ((𝐴 ≈ ω ∧ ω ≈ ℕ) → 𝐴 ≈ ℕ)
24	20, 22, 23	sylancl 413	1 ⊢ (𝜑 → 𝐴 ≈ ℕ)

Colors of variables: wff set class

Syntax hints: → wi 4 ↔ wb 105 DECID wdc 839 = wceq 1395 ∈ wcel 2200 ≠ wne 2400 ∀wral 2508 ∃wrex 2509 ∪ cun 3196 ∅c0 3492 ifcif 3603 {csn 3667 ⟨cop 3670 ∪ ciun 3968 class class class wbr 4086 ↦ cmpt 4148 suc csuc 4460 ωcom 4686 ^◡ccnv 4722 dom cdm 4723 ran crn 4724 “ cima 4726 –1-1→wf1 5321 –onto→wfo 5322 –1-1-onto→wf1o 5323 ‘cfv 5324 (class class class)co 6013 ∈ cmpo 6015 freccfrec 6551 ↑_pm cpm 6813 ≈ cen 6902 0cc0 8022 1c1 8023 + caddc 8025 − cmin 8340 ℕcn 9133 ℕ₀cn0 9392 ℤcz 9469 seqcseq 10699

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 4202 ax-sep 4205 ax-nul 4213 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-iinf 4684 ax-cnex 8113 ax-resscn 8114 ax-1cn 8115 ax-1re 8116 ax-icn 8117 ax-addcl 8118 ax-addrcl 8119 ax-mulcl 8120 ax-addcom 8122 ax-addass 8124 ax-distr 8126 ax-i2m1 8127 ax-0lt1 8128 ax-0id 8130 ax-rnegex 8131 ax-cnre 8133 ax-pre-ltirr 8134 ax-pre-ltwlin 8135 ax-pre-lttrn 8136 ax-pre-ltadd 8138

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 2802 df-sbc 3030 df-csb 3126 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-nul 3493 df-if 3604 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-iun 3970 df-br 4087 df-opab 4149 df-mpt 4150 df-tr 4186 df-id 4388 df-iord 4461 df-on 4463 df-ilim 4464 df-suc 4466 df-iom 4687 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-1st 6298 df-2nd 6299 df-recs 6466 df-frec 6552 df-er 6697 df-pm 6815 df-en 6905 df-pnf 8206 df-mnf 8207 df-xr 8208 df-ltxr 8209 df-le 8210 df-sub 8342 df-neg 8343 df-inn 9134 df-n0 9393 df-z 9470 df-uz 9746 df-seqfrec 10700

This theorem is referenced by: ennnfonelemnn0 13033

W3C validator