ennnfonelemom - Intuitionistic Logic Explorer

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

Theorem ennnfonelemom 12979

Description: Lemma for ennnfone 12996. 𝐻 yields finite sequences. (Contributed by Jim Kingdon, 19-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(𝐺, 𝐽)
ennnfonelemom.p	⊢ (𝜑 → 𝑃 ∈ ℕ₀)

**Assertion**
Ref	Expression
ennnfonelemom	⊢ (𝜑 → dom (𝐻‘𝑃) ∈ ω)

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

Proof of Theorem ennnfonelemom Dummy variables 𝑓 𝑔 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ennnfonelemh.h	. . . 4 ⊢ 𝐻 = seq0(𝐺, 𝐽)
2	1	fveq1i 5628	. . 3 ⊢ (𝐻‘𝑃) = (seq0(𝐺, 𝐽)‘𝑃)
3	2	dmeqi 4924	. 2 ⊢ dom (𝐻‘𝑃) = dom (seq0(𝐺, 𝐽)‘𝑃)
4		ennnfonelemh.dceq	. . . . . . 7 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
5		ennnfonelemh.f	. . . . . . 7 ⊢ (𝜑 → 𝐹:ω–onto→𝐴)
6		ennnfonelemh.ne	. . . . . . 7 ⊢ (𝜑 → ∀𝑛 ∈ ω ∃𝑘 ∈ ω ∀𝑗 ∈ suc 𝑛(𝐹‘𝑘) ≠ (𝐹‘𝑗))
7		ennnfonelemh.g	. . . . . . 7 ⊢ 𝐺 = (𝑥 ∈ (𝐴 ↑_pm ω), 𝑦 ∈ ω ↦ if((𝐹‘𝑦) ∈ (𝐹 “ 𝑦), 𝑥, (𝑥 ∪ {⟨dom 𝑥, (𝐹‘𝑦)⟩})))
8		ennnfonelemh.n	. . . . . . 7 ⊢ 𝑁 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)
9		ennnfonelemh.j	. . . . . . 7 ⊢ 𝐽 = (𝑥 ∈ ℕ₀ ↦ if(𝑥 = 0, ∅, (^◡𝑁‘(𝑥 − 1))))
10	4, 5, 6, 7, 8, 9, 1	ennnfonelemj0 12972	. . . . . 6 ⊢ (𝜑 → (𝐽‘0) ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω})
11	4, 5, 6, 7, 8, 9, 1	ennnfonelemg 12974	. . . . . 6 ⊢ ((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) → (𝑓𝐺𝑗) ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω})
12		nn0uz 9757	. . . . . 6 ⊢ ℕ₀ = (ℤ_≥‘0)
13		0zd 9458	. . . . . 6 ⊢ (𝜑 → 0 ∈ ℤ)
14	4, 5, 6, 7, 8, 9, 1	ennnfonelemjn 12973	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ (ℤ_≥‘(0 + 1))) → (𝐽‘𝑓) ∈ ω)
15	10, 11, 12, 13, 14	seqf2 10690	. . . . 5 ⊢ (𝜑 → seq0(𝐺, 𝐽):ℕ₀⟶{𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω})
16		ennnfonelemom.p	. . . . 5 ⊢ (𝜑 → 𝑃 ∈ ℕ₀)
17	15, 16	ffvelcdmd 5771	. . . 4 ⊢ (𝜑 → (seq0(𝐺, 𝐽)‘𝑃) ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω})
18		dmeq 4923	. . . . . 6 ⊢ (𝑔 = (seq0(𝐺, 𝐽)‘𝑃) → dom 𝑔 = dom (seq0(𝐺, 𝐽)‘𝑃))
19	18	eleq1d 2298	. . . . 5 ⊢ (𝑔 = (seq0(𝐺, 𝐽)‘𝑃) → (dom 𝑔 ∈ ω ↔ dom (seq0(𝐺, 𝐽)‘𝑃) ∈ ω))
20	19	elrab 2959	. . . 4 ⊢ ((seq0(𝐺, 𝐽)‘𝑃) ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ↔ ((seq0(𝐺, 𝐽)‘𝑃) ∈ (𝐴 ↑_pm ω) ∧ dom (seq0(𝐺, 𝐽)‘𝑃) ∈ ω))
21	17, 20	sylib 122	. . 3 ⊢ (𝜑 → ((seq0(𝐺, 𝐽)‘𝑃) ∈ (𝐴 ↑_pm ω) ∧ dom (seq0(𝐺, 𝐽)‘𝑃) ∈ ω))
22	21	simprd 114	. 2 ⊢ (𝜑 → dom (seq0(𝐺, 𝐽)‘𝑃) ∈ ω)
23	3, 22	eqeltrid 2316	1 ⊢ (𝜑 → dom (𝐻‘𝑃) ∈ ω)

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 DECID wdc 839 = wceq 1395 ∈ wcel 2200 ≠ wne 2400 ∀wral 2508 ∃wrex 2509 {crab 2512 ∪ cun 3195 ∅c0 3491 ifcif 3602 {csn 3666 ⟨cop 3669 ↦ cmpt 4145 suc csuc 4456 ωcom 4682 ^◡ccnv 4718 dom cdm 4719 “ cima 4722 –onto→wfo 5316 ‘cfv 5318 (class class class)co 6001 ∈ cmpo 6003 freccfrec 6536 ↑_pm cpm 6796 0cc0 7999 1c1 8000 + caddc 8002 − cmin 8317 ℕ₀cn0 9369 ℤcz 9446 seqcseq 10669

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 8090 ax-resscn 8091 ax-1cn 8092 ax-1re 8093 ax-icn 8094 ax-addcl 8095 ax-addrcl 8096 ax-mulcl 8097 ax-addcom 8099 ax-addass 8101 ax-distr 8103 ax-i2m1 8104 ax-0lt1 8105 ax-0id 8107 ax-rnegex 8108 ax-cnre 8110 ax-pre-ltirr 8111 ax-pre-ltwlin 8112 ax-pre-lttrn 8113 ax-pre-ltadd 8115

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 5954 df-ov 6004 df-oprab 6005 df-mpo 6006 df-1st 6286 df-2nd 6287 df-recs 6451 df-frec 6537 df-pm 6798 df-pnf 8183 df-mnf 8184 df-xr 8185 df-ltxr 8186 df-le 8187 df-sub 8319 df-neg 8320 df-inn 9111 df-n0 9370 df-z 9447 df-uz 9723 df-seqfrec 10670

This theorem is referenced by: ennnfonelemkh 12983 ennnfonelemhf1o 12984 ennnfonelemex 12985 ennnfonelemhom 12986 ennnfonelemdm 12991

W3C validator