ennnfonelem0 - Intuitionistic Logic Explorer

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

Theorem ennnfonelem0 13025

Description: Lemma for ennnfone 13045. Initial value. (Contributed by Jim Kingdon, 15-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
ennnfonelem0	⊢ (𝜑 → (𝐻‘0) = ∅)

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

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

Step	Hyp	Ref	Expression
1		ennnfonelemh.h	. . . 4 ⊢ 𝐻 = seq0(𝐺, 𝐽)
2	1	fveq1i 5640	. . 3 ⊢ (𝐻‘0) = (seq0(𝐺, 𝐽)‘0)
3		ennnfonelemh.dceq	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
4		ennnfonelemh.f	. . . . 5 ⊢ (𝜑 → 𝐹:ω–onto→𝐴)
5		ennnfonelemh.ne	. . . . 5 ⊢ (𝜑 → ∀𝑛 ∈ ω ∃𝑘 ∈ ω ∀𝑗 ∈ suc 𝑛(𝐹‘𝑘) ≠ (𝐹‘𝑗))
6		ennnfonelemh.g	. . . . 5 ⊢ 𝐺 = (𝑥 ∈ (𝐴 ↑_pm ω), 𝑦 ∈ ω ↦ if((𝐹‘𝑦) ∈ (𝐹 “ 𝑦), 𝑥, (𝑥 ∪ {⟨dom 𝑥, (𝐹‘𝑦)⟩})))
7		ennnfonelemh.n	. . . . 5 ⊢ 𝑁 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)
8		ennnfonelemh.j	. . . . 5 ⊢ 𝐽 = (𝑥 ∈ ℕ₀ ↦ if(𝑥 = 0, ∅, (^◡𝑁‘(𝑥 − 1))))
9	3, 4, 5, 6, 7, 8, 1	ennnfonelemj0 13021	. . . 4 ⊢ (𝜑 → (𝐽‘0) ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω})
10	3, 4, 5, 6, 7, 8, 1	ennnfonelemg 13023	. . . 4 ⊢ ((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) → (𝑓𝐺𝑗) ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω})
11		0zd 9490	. . . 4 ⊢ (𝜑 → 0 ∈ ℤ)
12	3, 4, 5, 6, 7, 8, 1	ennnfonelemjn 13022	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ (ℤ_≥‘(0 + 1))) → (𝐽‘𝑓) ∈ ω)
13	9, 10, 11, 12	seq1cd 10730	. . 3 ⊢ (𝜑 → (seq0(𝐺, 𝐽)‘0) = (𝐽‘0))
14	2, 13	eqtrid 2276	. 2 ⊢ (𝜑 → (𝐻‘0) = (𝐽‘0))
15		0nn0 9416	. . . 4 ⊢ 0 ∈ ℕ₀
16		eqid 2231	. . . . . 6 ⊢ 0 = 0
17	16	iftruei 3611	. . . . 5 ⊢ if(0 = 0, ∅, (^◡𝑁‘(0 − 1))) = ∅
18		0ex 4216	. . . . 5 ⊢ ∅ ∈ V
19	17, 18	eqeltri 2304	. . . 4 ⊢ if(0 = 0, ∅, (^◡𝑁‘(0 − 1))) ∈ V
20		eqeq1 2238	. . . . . 6 ⊢ (𝑥 = 0 → (𝑥 = 0 ↔ 0 = 0))
21		fvoveq1 6040	. . . . . 6 ⊢ (𝑥 = 0 → (^◡𝑁‘(𝑥 − 1)) = (^◡𝑁‘(0 − 1)))
22	20, 21	ifbieq2d 3630	. . . . 5 ⊢ (𝑥 = 0 → if(𝑥 = 0, ∅, (^◡𝑁‘(𝑥 − 1))) = if(0 = 0, ∅, (^◡𝑁‘(0 − 1))))
23	22, 8	fvmptg 5722	. . . 4 ⊢ ((0 ∈ ℕ₀ ∧ if(0 = 0, ∅, (^◡𝑁‘(0 − 1))) ∈ V) → (𝐽‘0) = if(0 = 0, ∅, (^◡𝑁‘(0 − 1))))
24	15, 19, 23	mp2an 426	. . 3 ⊢ (𝐽‘0) = if(0 = 0, ∅, (^◡𝑁‘(0 − 1)))
25	24, 17	eqtri 2252	. 2 ⊢ (𝐽‘0) = ∅
26	14, 25	eqtrdi 2280	1 ⊢ (𝜑 → (𝐻‘0) = ∅)

Colors of variables: wff set class

Syntax hints: → wi 4 DECID wdc 841 = wceq 1397 ∈ wcel 2202 ≠ wne 2402 ∀wral 2510 ∃wrex 2511 {crab 2514 Vcvv 2802 ∪ cun 3198 ∅c0 3494 ifcif 3605 {csn 3669 ⟨cop 3672 ↦ cmpt 4150 suc csuc 4462 ωcom 4688 ^◡ccnv 4724 dom cdm 4725 “ cima 4728 –onto→wfo 5324 ‘cfv 5326 (class class class)co 6017 ∈ cmpo 6019 freccfrec 6555 ↑_pm cpm 6817 0cc0 8031 1c1 8032 + caddc 8034 − cmin 8349 ℕ₀cn0 9401 ℤcz 9478 seqcseq 10708

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 8122 ax-resscn 8123 ax-1cn 8124 ax-1re 8125 ax-icn 8126 ax-addcl 8127 ax-addrcl 8128 ax-mulcl 8129 ax-addcom 8131 ax-addass 8133 ax-distr 8135 ax-i2m1 8136 ax-0lt1 8137 ax-0id 8139 ax-rnegex 8140 ax-cnre 8142 ax-pre-ltirr 8143 ax-pre-ltwlin 8144 ax-pre-lttrn 8145 ax-pre-ltadd 8147

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 5970 df-ov 6020 df-oprab 6021 df-mpo 6022 df-1st 6302 df-2nd 6303 df-recs 6470 df-frec 6556 df-pm 6819 df-pnf 8215 df-mnf 8216 df-xr 8217 df-ltxr 8218 df-le 8219 df-sub 8351 df-neg 8352 df-inn 9143 df-n0 9402 df-z 9479 df-uz 9755 df-seqfrec 10709

This theorem is referenced by: ennnfonelem1 13027 ennnfonelemkh 13032 ennnfonelemhf1o 13033

W3C validator