ennnfonelemh - Intuitionistic Logic Explorer

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

Theorem ennnfonelemh 13105

Description: Lemma for ennnfone 13126. (Contributed by Jim Kingdon, 8-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(𝐺, 𝐽)

**Assertion**
Ref	Expression
ennnfonelemh	⊢ (𝜑 → 𝐻:ℕ₀⟶(𝐴 ↑_pm ω))

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

Proof of Theorem ennnfonelemh 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 ⊢ 𝐽 = (𝑥 ∈ ℕ₀ ↦ if(𝑥 = 0, ∅, (^◡𝑁‘(𝑥 − 1))))
7		ennnfonelemh.h	. . . . 5 ⊢ 𝐻 = seq0(𝐺, 𝐽)
8	1, 2, 3, 4, 5, 6, 7	ennnfonelemj0 13102	. . . 4 ⊢ (𝜑 → (𝐽‘0) ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω})
9	1, 2, 3, 4, 5, 6, 7	ennnfonelemg 13104	. . . 4 ⊢ ((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) → (𝑓𝐺𝑗) ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω})
10		nn0uz 9852	. . . 4 ⊢ ℕ₀ = (ℤ_≥‘0)
11		0zd 9552	. . . 4 ⊢ (𝜑 → 0 ∈ ℤ)
12	1, 2, 3, 4, 5, 6, 7	ennnfonelemjn 13103	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ (ℤ_≥‘(0 + 1))) → (𝐽‘𝑓) ∈ ω)
13	8, 9, 10, 11, 12	seqf2 10793	. . 3 ⊢ (𝜑 → seq0(𝐺, 𝐽):ℕ₀⟶{𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω})
14		ssrab2 3313	. . . 4 ⊢ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ⊆ (𝐴 ↑_pm ω)
15	14	a1i 9	. . 3 ⊢ (𝜑 → {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ⊆ (𝐴 ↑_pm ω))
16	13, 15	fssd 5502	. 2 ⊢ (𝜑 → seq0(𝐺, 𝐽):ℕ₀⟶(𝐴 ↑_pm ω))
17	7	feq1i 5482	. 2 ⊢ (𝐻:ℕ₀⟶(𝐴 ↑_pm ω) ↔ seq0(𝐺, 𝐽):ℕ₀⟶(𝐴 ↑_pm ω))
18	16, 17	sylibr 134	1 ⊢ (𝜑 → 𝐻:ℕ₀⟶(𝐴 ↑_pm ω))

Colors of variables: wff set class

Syntax hints: → wi 4 DECID wdc 842 = wceq 1398 ∈ wcel 2202 ≠ wne 2403 ∀wral 2511 ∃wrex 2512 {crab 2515 ∪ cun 3199 ⊆ wss 3201 ∅c0 3496 ifcif 3607 {csn 3673 ⟨cop 3676 ↦ cmpt 4155 suc csuc 4468 ωcom 4694 ^◡ccnv 4730 dom cdm 4731 “ cima 4734 ⟶wf 5329 –onto→wfo 5331 ‘cfv 5333 (class class class)co 6028 ∈ cmpo 6030 freccfrec 6599 ↑_pm cpm 6861 0cc0 8092 1c1 8093 + caddc 8095 − cmin 8409 ℕ₀cn0 9461 ℤcz 9540 seqcseq 10772

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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-nul 4220 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-iinf 4692 ax-cnex 8183 ax-resscn 8184 ax-1cn 8185 ax-1re 8186 ax-icn 8187 ax-addcl 8188 ax-addrcl 8189 ax-mulcl 8190 ax-addcom 8192 ax-addass 8194 ax-distr 8196 ax-i2m1 8197 ax-0lt1 8198 ax-0id 8200 ax-rnegex 8201 ax-cnre 8203 ax-pre-ltirr 8204 ax-pre-ltwlin 8205 ax-pre-lttrn 8206 ax-pre-ltadd 8208

This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-if 3608 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-tr 4193 df-id 4396 df-iord 4469 df-on 4471 df-ilim 4472 df-suc 4474 df-iom 4695 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-1st 6312 df-2nd 6313 df-recs 6514 df-frec 6600 df-pm 6863 df-pnf 8275 df-mnf 8276 df-xr 8277 df-ltxr 8278 df-le 8279 df-sub 8411 df-neg 8412 df-inn 9203 df-n0 9462 df-z 9541 df-uz 9817 df-seqfrec 10773

This theorem is referenced by: ennnfonelemp1 13107 ennnfonelemrnh 13117 ennnfonelemfun 13118 ennnfonelemf1 13119

W3C validator