| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ruclem7 | Structured version Visualization version GIF version | ||
| Description: Lemma for ruc 16455. Successor value for the interval sequence. (Contributed by Mario Carneiro, 28-May-2014.) |
| Ref | Expression |
|---|---|
| ruc.1 | ⊢ (𝜑 → 𝐹:ℕ⟶ℝ) |
| ruc.2 | ⊢ (𝜑 → 𝐷 = (𝑥 ∈ (ℝ × ℝ), 𝑦 ∈ ℝ ↦ ⦋(((1st ‘𝑥) + (2nd ‘𝑥)) / 2) / 𝑚⦌if(𝑚 < 𝑦, 〈(1st ‘𝑥), 𝑚〉, 〈((𝑚 + (2nd ‘𝑥)) / 2), (2nd ‘𝑥)〉))) |
| ruc.4 | ⊢ 𝐶 = ({〈0, 〈0, 1〉〉} ∪ 𝐹) |
| ruc.5 | ⊢ 𝐺 = seq0(𝐷, 𝐶) |
| Ref | Expression |
|---|---|
| ruclem7 | ⊢ ((𝜑 ∧ 𝑁 ∈ ℕ0) → (𝐺‘(𝑁 + 1)) = ((𝐺‘𝑁)𝐷(𝐹‘(𝑁 + 1)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 490 | . . . . 5 ⊢ ((𝜑 ∧ 𝑁 ∈ ℕ0) → 𝑁 ∈ ℕ0) | |
| 2 | nn0uz 13043 | . . . . 5 ⊢ ℕ0 = (ℤ≥‘0) | |
| 3 | 1, 2 | eleqtrdi 2874 | . . . 4 ⊢ ((𝜑 ∧ 𝑁 ∈ ℕ0) → 𝑁 ∈ (ℤ≥‘0)) |
| 4 | seqp1 14199 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘0) → (seq0(𝐷, 𝐶)‘(𝑁 + 1)) = ((seq0(𝐷, 𝐶)‘𝑁)𝐷(𝐶‘(𝑁 + 1)))) | |
| 5 | 3, 4 | syl 18 | . . 3 ⊢ ((𝜑 ∧ 𝑁 ∈ ℕ0) → (seq0(𝐷, 𝐶)‘(𝑁 + 1)) = ((seq0(𝐷, 𝐶)‘𝑁)𝐷(𝐶‘(𝑁 + 1)))) |
| 6 | ruc.5 | . . . 4 ⊢ 𝐺 = seq0(𝐷, 𝐶) | |
| 7 | 6 | fveq1i 6917 | . . 3 ⊢ (𝐺‘(𝑁 + 1)) = (seq0(𝐷, 𝐶)‘(𝑁 + 1)) |
| 8 | 6 | fveq1i 6917 | . . . 4 ⊢ (𝐺‘𝑁) = (seq0(𝐷, 𝐶)‘𝑁) |
| 9 | 8 | oveq1i 7461 | . . 3 ⊢ ((𝐺‘𝑁)𝐷(𝐶‘(𝑁 + 1))) = ((seq0(𝐷, 𝐶)‘𝑁)𝐷(𝐶‘(𝑁 + 1))) |
| 10 | 5, 7, 9 | 3eqtr4g 2823 | . 2 ⊢ ((𝜑 ∧ 𝑁 ∈ ℕ0) → (𝐺‘(𝑁 + 1)) = ((𝐺‘𝑁)𝐷(𝐶‘(𝑁 + 1)))) |
| 11 | nn0p1nn 12685 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ) | |
| 12 | 11 | adantl 487 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑁 ∈ ℕ0) → (𝑁 + 1) ∈ ℕ) |
| 13 | 12 | nnne0d 12428 | . . . . 5 ⊢ ((𝜑 ∧ 𝑁 ∈ ℕ0) → (𝑁 + 1) ≠ 0) |
| 14 | 13 | necomd 3014 | . . . 4 ⊢ ((𝜑 ∧ 𝑁 ∈ ℕ0) → 0 ≠ (𝑁 + 1)) |
| 15 | ruc.4 | . . . . . . 7 ⊢ 𝐶 = ({〈0, 〈0, 1〉〉} ∪ 𝐹) | |
| 16 | 15 | equncomi 4162 | . . . . . 6 ⊢ 𝐶 = (𝐹 ∪ {〈0, 〈0, 1〉〉}) |
| 17 | 16 | fveq1i 6917 | . . . . 5 ⊢ (𝐶‘(𝑁 + 1)) = ((𝐹 ∪ {〈0, 〈0, 1〉〉})‘(𝑁 + 1)) |
| 18 | fvunsn 7215 | . . . . 5 ⊢ (0 ≠ (𝑁 + 1) → ((𝐹 ∪ {〈0, 〈0, 1〉〉})‘(𝑁 + 1)) = (𝐹‘(𝑁 + 1))) | |
| 19 | 17, 18 | eqtrid 2810 | . . . 4 ⊢ (0 ≠ (𝑁 + 1) → (𝐶‘(𝑁 + 1)) = (𝐹‘(𝑁 + 1))) |
| 20 | 14, 19 | syl 18 | . . 3 ⊢ ((𝜑 ∧ 𝑁 ∈ ℕ0) → (𝐶‘(𝑁 + 1)) = (𝐹‘(𝑁 + 1))) |
| 21 | 20 | oveq2d 7467 | . 2 ⊢ ((𝜑 ∧ 𝑁 ∈ ℕ0) → ((𝐺‘𝑁)𝐷(𝐶‘(𝑁 + 1))) = ((𝐺‘𝑁)𝐷(𝐹‘(𝑁 + 1)))) |
| 22 | 10, 21 | eqtrd 2798 | 1 ⊢ ((𝜑 ∧ 𝑁 ∈ ℕ0) → (𝐺‘(𝑁 + 1)) = ((𝐺‘𝑁)𝐷(𝐹‘(𝑁 + 1)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ⦋csb 3851 ∪ cun 4152 ifcif 4485 {csn 4588 〈cop 4840 class class class wbr 5108 × cxp 5656 ⟶wf 6562 ‘cfv 6566 (class class class)co 7451 ∈ cmpo 7453 1st c1st 8033 2nd c2nd 8034 ℝcr 11238 0cc0 11239 1c1 11240 + caddc 11242 < clt 11382 / cdiv 12013 ℕcn 12375 2c2 12437 ℕ0cn0 12646 ℤ≥cuz 13005 seqcseq 14184 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-n0 12647 df-z 12734 df-uz 13006 df-seq 14185 |
| This theorem is used by: ruclem8 16449 ruclem9 16450 ruclem12 16453 |
| Copyright terms: Public domain | W3C validator |