| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ennnfonelemjn | GIF version | ||
| Description: Lemma for ennnfone 13197. Non-initial state for 𝐽. (Contributed by Jim Kingdon, 20-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 |
|---|---|
| ennnfonelemjn | ⊢ ((𝜑 ∧ 𝑓 ∈ (ℤ≥‘(0 + 1))) → (𝐽‘𝑓) ∈ ω) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nnuz 9896 | . . . 4 ⊢ ℕ = (ℤ≥‘1) | |
| 2 | 0p1e1 9356 | . . . . 5 ⊢ (0 + 1) = 1 | |
| 3 | 2 | fveq2i 5675 | . . . 4 ⊢ (ℤ≥‘(0 + 1)) = (ℤ≥‘1) |
| 4 | 1, 3 | eqtr4i 2258 | . . 3 ⊢ ℕ = (ℤ≥‘(0 + 1)) |
| 5 | 4 | eleq2i 2301 | . 2 ⊢ (𝑓 ∈ ℕ ↔ 𝑓 ∈ (ℤ≥‘(0 + 1))) |
| 6 | ennnfonelemh.j | . . . 4 ⊢ 𝐽 = (𝑥 ∈ ℕ0 ↦ if(𝑥 = 0, ∅, (◡𝑁‘(𝑥 − 1)))) | |
| 7 | eqeq1 2241 | . . . . 5 ⊢ (𝑥 = 𝑓 → (𝑥 = 0 ↔ 𝑓 = 0)) | |
| 8 | fvoveq1 6075 | . . . . 5 ⊢ (𝑥 = 𝑓 → (◡𝑁‘(𝑥 − 1)) = (◡𝑁‘(𝑓 − 1))) | |
| 9 | 7, 8 | ifbieq2d 3649 | . . . 4 ⊢ (𝑥 = 𝑓 → if(𝑥 = 0, ∅, (◡𝑁‘(𝑥 − 1))) = if(𝑓 = 0, ∅, (◡𝑁‘(𝑓 − 1)))) |
| 10 | nnnn0 9508 | . . . . 5 ⊢ (𝑓 ∈ ℕ → 𝑓 ∈ ℕ0) | |
| 11 | 10 | adantl 277 | . . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ ℕ) → 𝑓 ∈ ℕ0) |
| 12 | nnne0 9270 | . . . . . . . 8 ⊢ (𝑓 ∈ ℕ → 𝑓 ≠ 0) | |
| 13 | 12 | neneqd 2435 | . . . . . . 7 ⊢ (𝑓 ∈ ℕ → ¬ 𝑓 = 0) |
| 14 | 13 | iffalsed 3634 | . . . . . 6 ⊢ (𝑓 ∈ ℕ → if(𝑓 = 0, ∅, (◡𝑁‘(𝑓 − 1))) = (◡𝑁‘(𝑓 − 1))) |
| 15 | 14 | adantl 277 | . . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ ℕ) → if(𝑓 = 0, ∅, (◡𝑁‘(𝑓 − 1))) = (◡𝑁‘(𝑓 − 1))) |
| 16 | 0zd 9594 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ ℕ) → 0 ∈ ℤ) | |
| 17 | ennnfonelemh.n | . . . . . . . 8 ⊢ 𝑁 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) | |
| 18 | 16, 17 | frec2uzf1od 10775 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 ∈ ℕ) → 𝑁:ω–1-1-onto→(ℤ≥‘0)) |
| 19 | f1ocnv 5629 | . . . . . . 7 ⊢ (𝑁:ω–1-1-onto→(ℤ≥‘0) → ◡𝑁:(ℤ≥‘0)–1-1-onto→ω) | |
| 20 | f1of 5616 | . . . . . . 7 ⊢ (◡𝑁:(ℤ≥‘0)–1-1-onto→ω → ◡𝑁:(ℤ≥‘0)⟶ω) | |
| 21 | 18, 19, 20 | 3syl 17 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ ℕ) → ◡𝑁:(ℤ≥‘0)⟶ω) |
| 22 | 0z 9593 | . . . . . . 7 ⊢ 0 ∈ ℤ | |
| 23 | 5 | biimpi 120 | . . . . . . . 8 ⊢ (𝑓 ∈ ℕ → 𝑓 ∈ (ℤ≥‘(0 + 1))) |
| 24 | 23 | adantl 277 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 ∈ ℕ) → 𝑓 ∈ (ℤ≥‘(0 + 1))) |
| 25 | eluzp1m1 9884 | . . . . . . 7 ⊢ ((0 ∈ ℤ ∧ 𝑓 ∈ (ℤ≥‘(0 + 1))) → (𝑓 − 1) ∈ (ℤ≥‘0)) | |
| 26 | 22, 24, 25 | sylancr 414 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ ℕ) → (𝑓 − 1) ∈ (ℤ≥‘0)) |
| 27 | 21, 26 | ffvelcdmd 5815 | . . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ ℕ) → (◡𝑁‘(𝑓 − 1)) ∈ ω) |
| 28 | 15, 27 | eqeltrd 2311 | . . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ ℕ) → if(𝑓 = 0, ∅, (◡𝑁‘(𝑓 − 1))) ∈ ω) |
| 29 | 6, 9, 11, 28 | fvmptd3 5773 | . . 3 ⊢ ((𝜑 ∧ 𝑓 ∈ ℕ) → (𝐽‘𝑓) = if(𝑓 = 0, ∅, (◡𝑁‘(𝑓 − 1)))) |
| 30 | 29, 28 | eqeltrd 2311 | . 2 ⊢ ((𝜑 ∧ 𝑓 ∈ ℕ) → (𝐽‘𝑓) ∈ ω) |
| 31 | 5, 30 | sylan2br 288 | 1 ⊢ ((𝜑 ∧ 𝑓 ∈ (ℤ≥‘(0 + 1))) → (𝐽‘𝑓) ∈ ω) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 DECID wdc 842 = wceq 1398 ∈ wcel 2205 ≠ wne 2414 ∀wral 2522 ∃wrex 2523 ∪ cun 3211 ∅c0 3510 ifcif 3622 {csn 3691 〈cop 3694 ↦ cmpt 4173 suc csuc 4488 ωcom 4714 ◡ccnv 4750 dom cdm 4751 “ cima 4754 ⟶wf 5350 –onto→wfo 5352 –1-1-onto→wf1o 5353 ‘cfv 5354 (class class class)co 6052 ∈ cmpo 6054 freccfrec 6623 ↑pm cpm 6885 0cc0 8132 1c1 8133 + caddc 8135 − cmin 8449 ℕcn 9242 ℕ0cn0 9501 ℤcz 9582 ℤ≥cuz 9859 seqcseq 10816 |
| 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 4227 ax-sep 4230 ax-nul 4238 ax-pow 4289 ax-pr 4324 ax-un 4556 ax-setind 4661 ax-iinf 4712 ax-cnex 8223 ax-resscn 8224 ax-1cn 8225 ax-1re 8226 ax-icn 8227 ax-addcl 8228 ax-addrcl 8229 ax-mulcl 8230 ax-addcom 8232 ax-addass 8234 ax-distr 8236 ax-i2m1 8237 ax-0lt1 8238 ax-0id 8240 ax-rnegex 8241 ax-cnre 8243 ax-pre-ltirr 8244 ax-pre-ltwlin 8245 ax-pre-lttrn 8246 ax-pre-ltadd 8248 |
| This theorem depends on definitions: df-bi 117 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 3045 df-csb 3141 df-dif 3215 df-un 3217 df-in 3219 df-ss 3226 df-nul 3511 df-if 3623 df-pw 3673 df-sn 3697 df-pr 3698 df-op 3700 df-uni 3917 df-int 3952 df-iun 3995 df-br 4112 df-opab 4174 df-mpt 4175 df-tr 4211 df-id 4416 df-iord 4489 df-on 4491 df-ilim 4492 df-suc 4494 df-iom 4715 df-xp 4757 df-rel 4758 df-cnv 4759 df-co 4760 df-dm 4761 df-rn 4762 df-res 4763 df-ima 4764 df-iota 5314 df-fun 5356 df-fn 5357 df-f 5358 df-f1 5359 df-fo 5360 df-f1o 5361 df-fv 5362 df-riota 6005 df-ov 6055 df-oprab 6056 df-mpo 6057 df-recs 6538 df-frec 6624 df-pnf 8315 df-mnf 8316 df-xr 8317 df-ltxr 8318 df-le 8319 df-sub 8451 df-neg 8452 df-inn 9243 df-n0 9502 df-z 9583 df-uz 9860 |
| This theorem is referenced by: ennnfonelemh 13176 ennnfonelem0 13177 ennnfonelemp1 13178 ennnfonelemom 13180 |
| Copyright terms: Public domain | W3C validator |