![]() |
Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > itcovalpclem1 | Structured version Visualization version GIF version |
Description: Lemma 1 for itcovalpc 45436: induction basis. (Contributed by AV, 4-May-2024.) |
Ref | Expression |
---|---|
itcovalpc.f | ⊢ 𝐹 = (𝑛 ∈ ℕ0 ↦ (𝑛 + 𝐶)) |
Ref | Expression |
---|---|
itcovalpclem1 | ⊢ (𝐶 ∈ ℕ0 → ((IterComp‘𝐹)‘0) = (𝑛 ∈ ℕ0 ↦ (𝑛 + (𝐶 · 0)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nn0ex 11925 | . . 3 ⊢ ℕ0 ∈ V | |
2 | ovexd 7178 | . . . 4 ⊢ (𝑛 ∈ ℕ0 → (𝑛 + 𝐶) ∈ V) | |
3 | 2 | rgen 3078 | . . 3 ⊢ ∀𝑛 ∈ ℕ0 (𝑛 + 𝐶) ∈ V |
4 | itcovalpc.f | . . . 4 ⊢ 𝐹 = (𝑛 ∈ ℕ0 ↦ (𝑛 + 𝐶)) | |
5 | 4 | itcoval0mpt 45430 | . . 3 ⊢ ((ℕ0 ∈ V ∧ ∀𝑛 ∈ ℕ0 (𝑛 + 𝐶) ∈ V) → ((IterComp‘𝐹)‘0) = (𝑛 ∈ ℕ0 ↦ 𝑛)) |
6 | 1, 3, 5 | mp2an 692 | . 2 ⊢ ((IterComp‘𝐹)‘0) = (𝑛 ∈ ℕ0 ↦ 𝑛) |
7 | nn0cn 11929 | . . . . . . 7 ⊢ (𝐶 ∈ ℕ0 → 𝐶 ∈ ℂ) | |
8 | 7 | mul01d 10862 | . . . . . 6 ⊢ (𝐶 ∈ ℕ0 → (𝐶 · 0) = 0) |
9 | 8 | adantr 485 | . . . . 5 ⊢ ((𝐶 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0) → (𝐶 · 0) = 0) |
10 | 9 | oveq2d 7159 | . . . 4 ⊢ ((𝐶 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0) → (𝑛 + (𝐶 · 0)) = (𝑛 + 0)) |
11 | nn0cn 11929 | . . . . . 6 ⊢ (𝑛 ∈ ℕ0 → 𝑛 ∈ ℂ) | |
12 | 11 | addid1d 10863 | . . . . 5 ⊢ (𝑛 ∈ ℕ0 → (𝑛 + 0) = 𝑛) |
13 | 12 | adantl 486 | . . . 4 ⊢ ((𝐶 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0) → (𝑛 + 0) = 𝑛) |
14 | 10, 13 | eqtr2d 2795 | . . 3 ⊢ ((𝐶 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0) → 𝑛 = (𝑛 + (𝐶 · 0))) |
15 | 14 | mpteq2dva 5120 | . 2 ⊢ (𝐶 ∈ ℕ0 → (𝑛 ∈ ℕ0 ↦ 𝑛) = (𝑛 ∈ ℕ0 ↦ (𝑛 + (𝐶 · 0)))) |
16 | 6, 15 | syl5eq 2806 | 1 ⊢ (𝐶 ∈ ℕ0 → ((IterComp‘𝐹)‘0) = (𝑛 ∈ ℕ0 ↦ (𝑛 + (𝐶 · 0)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 400 = wceq 1539 ∈ wcel 2112 ∀wral 3068 Vcvv 3407 ↦ cmpt 5105 ‘cfv 6328 (class class class)co 7143 0cc0 10560 + caddc 10563 · cmul 10565 ℕ0cn0 11919 IterCompcitco 45421 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1912 ax-6 1971 ax-7 2016 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2159 ax-12 2176 ax-ext 2730 ax-rep 5149 ax-sep 5162 ax-nul 5169 ax-pow 5227 ax-pr 5291 ax-un 7452 ax-inf2 9122 ax-cnex 10616 ax-resscn 10617 ax-1cn 10618 ax-icn 10619 ax-addcl 10620 ax-addrcl 10621 ax-mulcl 10622 ax-mulrcl 10623 ax-mulcom 10624 ax-addass 10625 ax-mulass 10626 ax-distr 10627 ax-i2m1 10628 ax-1ne0 10629 ax-1rid 10630 ax-rnegex 10631 ax-rrecex 10632 ax-cnre 10633 ax-pre-lttri 10634 ax-pre-lttrn 10635 ax-pre-ltadd 10636 ax-pre-mulgt0 10637 |
This theorem depends on definitions: df-bi 210 df-an 401 df-or 846 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2071 df-mo 2558 df-eu 2589 df-clab 2737 df-cleq 2751 df-clel 2831 df-nfc 2899 df-ne 2950 df-nel 3054 df-ral 3073 df-rex 3074 df-reu 3075 df-rab 3077 df-v 3409 df-sbc 3694 df-csb 3802 df-dif 3857 df-un 3859 df-in 3861 df-ss 3871 df-pss 3873 df-nul 4222 df-if 4414 df-pw 4489 df-sn 4516 df-pr 4518 df-tp 4520 df-op 4522 df-uni 4792 df-iun 4878 df-br 5026 df-opab 5088 df-mpt 5106 df-tr 5132 df-id 5423 df-eprel 5428 df-po 5436 df-so 5437 df-fr 5476 df-we 5478 df-xp 5523 df-rel 5524 df-cnv 5525 df-co 5526 df-dm 5527 df-rn 5528 df-res 5529 df-ima 5530 df-pred 6119 df-ord 6165 df-on 6166 df-lim 6167 df-suc 6168 df-iota 6287 df-fun 6330 df-fn 6331 df-f 6332 df-f1 6333 df-fo 6334 df-f1o 6335 df-fv 6336 df-riota 7101 df-ov 7146 df-oprab 7147 df-mpo 7148 df-om 7573 df-2nd 7687 df-wrecs 7950 df-recs 8011 df-rdg 8049 df-er 8292 df-en 8521 df-dom 8522 df-sdom 8523 df-pnf 10700 df-mnf 10701 df-xr 10702 df-ltxr 10703 df-le 10704 df-sub 10895 df-neg 10896 df-nn 11660 df-n0 11920 df-z 12006 df-uz 12268 df-seq 13404 df-itco 45423 |
This theorem is referenced by: itcovalpc 45436 |
Copyright terms: Public domain | W3C validator |