| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ruclem4 | Structured version Visualization version GIF version | ||
| Description: Lemma for ruc 16299. Initial value of 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 |
|---|---|
| ruclem4 | ⊢ (𝜑 → (𝐺‘0) = 〈0, 1〉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ruc.5 | . . 3 ⊢ 𝐺 = seq0(𝐷, 𝐶) | |
| 2 | 1 | fveq1i 6883 | . 2 ⊢ (𝐺‘0) = (seq0(𝐷, 𝐶)‘0) |
| 3 | 0z 12602 | . . 3 ⊢ 0 ∈ ℤ | |
| 4 | ruc.4 | . . . . . 6 ⊢ 𝐶 = ({〈0, 〈0, 1〉〉} ∪ 𝐹) | |
| 5 | ruc.1 | . . . . . . . . 9 ⊢ (𝜑 → 𝐹:ℕ⟶ℝ) | |
| 6 | ffn 6706 | . . . . . . . . 9 ⊢ (𝐹:ℕ⟶ℝ → 𝐹 Fn ℕ) | |
| 7 | fnresdm 6655 | . . . . . . . . 9 ⊢ (𝐹 Fn ℕ → (𝐹 ↾ ℕ) = 𝐹) | |
| 8 | 5, 6, 7 | 3syl 19 | . . . . . . . 8 ⊢ (𝜑 → (𝐹 ↾ ℕ) = 𝐹) |
| 9 | dfn2 12517 | . . . . . . . . 9 ⊢ ℕ = (ℕ0 ∖ {0}) | |
| 10 | 9 | reseq2i 5976 | . . . . . . . 8 ⊢ (𝐹 ↾ ℕ) = (𝐹 ↾ (ℕ0 ∖ {0})) |
| 11 | 8, 10 | eqtr3di 2819 | . . . . . . 7 ⊢ (𝜑 → 𝐹 = (𝐹 ↾ (ℕ0 ∖ {0}))) |
| 12 | 11 | uneq2d 4130 | . . . . . 6 ⊢ (𝜑 → ({〈0, 〈0, 1〉〉} ∪ 𝐹) = ({〈0, 〈0, 1〉〉} ∪ (𝐹 ↾ (ℕ0 ∖ {0})))) |
| 13 | 4, 12 | eqtrid 2816 | . . . . 5 ⊢ (𝜑 → 𝐶 = ({〈0, 〈0, 1〉〉} ∪ (𝐹 ↾ (ℕ0 ∖ {0})))) |
| 14 | 13 | fveq1d 6884 | . . . 4 ⊢ (𝜑 → (𝐶‘0) = (({〈0, 〈0, 1〉〉} ∪ (𝐹 ↾ (ℕ0 ∖ {0})))‘0)) |
| 15 | c0ex 11200 | . . . . . . 7 ⊢ 0 ∈ V | |
| 16 | 15 | a1i 11 | . . . . . 6 ⊢ (⊤ → 0 ∈ V) |
| 17 | opex 5446 | . . . . . . 7 ⊢ 〈0, 1〉 ∈ V | |
| 18 | 17 | a1i 11 | . . . . . 6 ⊢ (⊤ → 〈0, 1〉 ∈ V) |
| 19 | eqid 2769 | . . . . . 6 ⊢ ({〈0, 〈0, 1〉〉} ∪ (𝐹 ↾ (ℕ0 ∖ {0}))) = ({〈0, 〈0, 1〉〉} ∪ (𝐹 ↾ (ℕ0 ∖ {0}))) | |
| 20 | 16, 18, 19 | fvsnun1 7181 | . . . . 5 ⊢ (⊤ → (({〈0, 〈0, 1〉〉} ∪ (𝐹 ↾ (ℕ0 ∖ {0})))‘0) = 〈0, 1〉) |
| 21 | 20 | mptru 1574 | . . . 4 ⊢ (({〈0, 〈0, 1〉〉} ∪ (𝐹 ↾ (ℕ0 ∖ {0})))‘0) = 〈0, 1〉 |
| 22 | 14, 21 | eqtrdi 2820 | . . 3 ⊢ (𝜑 → (𝐶‘0) = 〈0, 1〉) |
| 23 | 3, 22 | seq1i 14051 | . 2 ⊢ (𝜑 → (seq0(𝐷, 𝐶)‘0) = 〈0, 1〉) |
| 24 | 2, 23 | eqtrid 2816 | 1 ⊢ (𝜑 → (𝐺‘0) = 〈0, 1〉) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1567 ⊤wtru 1568 ∈ wcel 2149 Vcvv 3463 ⦋csb 3861 ∖ cdif 3910 ∪ cun 3911 ifcif 4492 {csn 4594 〈cop 4600 class class class wbr 5113 × cxp 5660 ↾ cres 5664 Fn wfn 6532 ⟶wf 6533 ‘cfv 6537 (class class class)co 7411 ∈ cmpo 7413 1st c1st 7984 2nd c2nd 7985 ℝcr 11099 0cc0 11100 1c1 11101 + caddc 11103 < clt 11243 / cdiv 11871 ℕcn 12233 2c2 12295 ℕ0cn0 12504 seqcseq 14037 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11156 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7863 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-er 8694 df-en 8944 df-dom 8945 df-sdom 8946 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-nn 12234 df-n0 12505 df-z 12592 df-uz 12863 df-seq 14038 |
| This theorem is referenced by: ruclem6 16291 ruclem8 16293 ruclem11 16296 |
| Copyright terms: Public domain | W3C validator |