| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ennnfonelem0 | GIF version | ||
| Description: Lemma for ennnfone 13260. Initial value. (Contributed by Jim Kingdon, 15-Jul-2023.) |
| Ref | Expression |
|---|---|
| ennnfonelemh.dceq | ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦) |
| ennnfonelemh.f | ⊢ (𝜑 → 𝐹:ω–onto→𝐴) |
| ennnfonelemh.ne | ⊢ (𝜑 → ∀𝑛 ∈ ω ∃𝑘 ∈ ω ∀𝑗 ∈ suc 𝑛(𝐹‘𝑘) ≠ (𝐹‘𝑗)) |
| ennnfonelemh.g | ⊢ 𝐺 = (𝑥 ∈ (𝐴 ↑pm ω), 𝑦 ∈ ω ↦ if((𝐹‘𝑦) ∈ (𝐹 “ 𝑦), 𝑥, (𝑥 ∪ {〈dom 𝑥, (𝐹‘𝑦)〉}))) |
| ennnfonelemh.n | ⊢ 𝑁 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) |
| ennnfonelemh.j | ⊢ 𝐽 = (𝑥 ∈ ℕ0 ↦ if(𝑥 = 0, ∅, (◡𝑁‘(𝑥 − 1)))) |
| ennnfonelemh.h | ⊢ 𝐻 = seq0(𝐺, 𝐽) |
| Ref | Expression |
|---|---|
| ennnfonelem0 | ⊢ (𝜑 → (𝐻‘0) = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ennnfonelemh.h | . . . 4 ⊢ 𝐻 = seq0(𝐺, 𝐽) | |
| 2 | 1 | fveq1i 5676 | . . 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 ⊢ 𝐽 = (𝑥 ∈ ℕ0 ↦ if(𝑥 = 0, ∅, (◡𝑁‘(𝑥 − 1)))) | |
| 9 | 3, 4, 5, 6, 7, 8, 1 | ennnfonelemj0 13236 | . . . 4 ⊢ (𝜑 → (𝐽‘0) ∈ {𝑔 ∈ (𝐴 ↑pm ω) ∣ dom 𝑔 ∈ ω}) |
| 10 | 3, 4, 5, 6, 7, 8, 1 | ennnfonelemg 13238 | . . . 4 ⊢ ((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) → (𝑓𝐺𝑗) ∈ {𝑔 ∈ (𝐴 ↑pm ω) ∣ dom 𝑔 ∈ ω}) |
| 11 | 0zd 9606 | . . . 4 ⊢ (𝜑 → 0 ∈ ℤ) | |
| 12 | 3, 4, 5, 6, 7, 8, 1 | ennnfonelemjn 13237 | . . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ (ℤ≥‘(0 + 1))) → (𝐽‘𝑓) ∈ ω) |
| 13 | 9, 10, 11, 12 | seq1cd 10855 | . . 3 ⊢ (𝜑 → (seq0(𝐺, 𝐽)‘0) = (𝐽‘0)) |
| 14 | 2, 13 | eqtrid 2279 | . 2 ⊢ (𝜑 → (𝐻‘0) = (𝐽‘0)) |
| 15 | 0nn0 9528 | . . . 4 ⊢ 0 ∈ ℕ0 | |
| 16 | eqid 2234 | . . . . . 6 ⊢ 0 = 0 | |
| 17 | 16 | iftruei 3632 | . . . . 5 ⊢ if(0 = 0, ∅, (◡𝑁‘(0 − 1))) = ∅ |
| 18 | 0ex 4242 | . . . . 5 ⊢ ∅ ∈ V | |
| 19 | 17, 18 | eqeltri 2307 | . . . 4 ⊢ if(0 = 0, ∅, (◡𝑁‘(0 − 1))) ∈ V |
| 20 | eqeq1 2241 | . . . . . 6 ⊢ (𝑥 = 0 → (𝑥 = 0 ↔ 0 = 0)) | |
| 21 | fvoveq1 6081 | . . . . . 6 ⊢ (𝑥 = 0 → (◡𝑁‘(𝑥 − 1)) = (◡𝑁‘(0 − 1))) | |
| 22 | 20, 21 | ifbieq2d 3651 | . . . . 5 ⊢ (𝑥 = 0 → if(𝑥 = 0, ∅, (◡𝑁‘(𝑥 − 1))) = if(0 = 0, ∅, (◡𝑁‘(0 − 1)))) |
| 23 | 22, 8 | fvmptg 5758 | . . . 4 ⊢ ((0 ∈ ℕ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 2255 | . 2 ⊢ (𝐽‘0) = ∅ |
| 26 | 14, 25 | eqtrdi 2283 | 1 ⊢ (𝜑 → (𝐻‘0) = ∅) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 DECID wdc 842 = wceq 1398 ∈ wcel 2205 ≠ wne 2414 ∀wral 2522 ∃wrex 2523 {crab 2526 Vcvv 2815 ∪ cun 3212 ∅c0 3512 ifcif 3624 {csn 3694 〈cop 3697 ↦ cmpt 4176 suc csuc 4491 ωcom 4717 ◡ccnv 4753 dom cdm 4754 “ cima 4757 –onto→wfo 5355 ‘cfv 5357 (class class class)co 6058 ∈ cmpo 6060 freccfrec 6634 ↑pm cpm 6896 0cc0 8143 1c1 8144 + caddc 8146 − cmin 8460 ℕ0cn0 9513 ℤcz 9594 seqcseq 10833 |
| 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 2207 ax-14 2208 ax-ext 2216 ax-coll 4230 ax-sep 4233 ax-nul 4241 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-iinf 4715 ax-cnex 8234 ax-resscn 8235 ax-1cn 8236 ax-1re 8237 ax-icn 8238 ax-addcl 8239 ax-addrcl 8240 ax-mulcl 8241 ax-addcom 8243 ax-addass 8245 ax-distr 8247 ax-i2m1 8248 ax-0lt1 8249 ax-0id 8251 ax-rnegex 8252 ax-cnre 8254 ax-pre-ltirr 8255 ax-pre-ltwlin 8256 ax-pre-lttrn 8257 ax-pre-ltadd 8259 |
| 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 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-if 3625 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 df-iun 3998 df-br 4115 df-opab 4177 df-mpt 4178 df-tr 4214 df-id 4419 df-iord 4492 df-on 4494 df-ilim 4495 df-suc 4497 df-iom 4718 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-fv 5365 df-riota 6011 df-ov 6061 df-oprab 6062 df-mpo 6063 df-1st 6347 df-2nd 6348 df-recs 6549 df-frec 6635 df-pm 6898 df-pnf 8326 df-mnf 8327 df-xr 8328 df-ltxr 8329 df-le 8330 df-sub 8462 df-neg 8463 df-inn 9255 df-n0 9514 df-z 9595 df-uz 9872 df-seqfrec 10834 |
| This theorem is referenced by: ennnfonelem1 13242 ennnfonelemkh 13247 ennnfonelemhf1o 13248 |
| Copyright terms: Public domain | W3C validator |