| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ruclem4 | Structured version Visualization version GIF version | ||
| Description: Lemma for ruc 16166. 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 6833 | . 2 ⊢ (𝐺‘0) = (seq0(𝐷, 𝐶)‘0) |
| 3 | 0z 12497 | . . 3 ⊢ 0 ∈ ℤ | |
| 4 | ruc.4 | . . . . . 6 ⊢ 𝐶 = ({〈0, 〈0, 1〉〉} ∪ 𝐹) | |
| 5 | ruc.1 | . . . . . . . . 9 ⊢ (𝜑 → 𝐹:ℕ⟶ℝ) | |
| 6 | ffn 6660 | . . . . . . . . 9 ⊢ (𝐹:ℕ⟶ℝ → 𝐹 Fn ℕ) | |
| 7 | fnresdm 6609 | . . . . . . . . 9 ⊢ (𝐹 Fn ℕ → (𝐹 ↾ ℕ) = 𝐹) | |
| 8 | 5, 6, 7 | 3syl 18 | . . . . . . . 8 ⊢ (𝜑 → (𝐹 ↾ ℕ) = 𝐹) |
| 9 | dfn2 12412 | . . . . . . . . 9 ⊢ ℕ = (ℕ0 ∖ {0}) | |
| 10 | 9 | reseq2i 5933 | . . . . . . . 8 ⊢ (𝐹 ↾ ℕ) = (𝐹 ↾ (ℕ0 ∖ {0})) |
| 11 | 8, 10 | eqtr3di 2784 | . . . . . . 7 ⊢ (𝜑 → 𝐹 = (𝐹 ↾ (ℕ0 ∖ {0}))) |
| 12 | 11 | uneq2d 4118 | . . . . . 6 ⊢ (𝜑 → ({〈0, 〈0, 1〉〉} ∪ 𝐹) = ({〈0, 〈0, 1〉〉} ∪ (𝐹 ↾ (ℕ0 ∖ {0})))) |
| 13 | 4, 12 | eqtrid 2781 | . . . . 5 ⊢ (𝜑 → 𝐶 = ({〈0, 〈0, 1〉〉} ∪ (𝐹 ↾ (ℕ0 ∖ {0})))) |
| 14 | 13 | fveq1d 6834 | . . . 4 ⊢ (𝜑 → (𝐶‘0) = (({〈0, 〈0, 1〉〉} ∪ (𝐹 ↾ (ℕ0 ∖ {0})))‘0)) |
| 15 | c0ex 11124 | . . . . . . 7 ⊢ 0 ∈ V | |
| 16 | 15 | a1i 11 | . . . . . 6 ⊢ (⊤ → 0 ∈ V) |
| 17 | opex 5410 | . . . . . . 7 ⊢ 〈0, 1〉 ∈ V | |
| 18 | 17 | a1i 11 | . . . . . 6 ⊢ (⊤ → 〈0, 1〉 ∈ V) |
| 19 | eqid 2734 | . . . . . 6 ⊢ ({〈0, 〈0, 1〉〉} ∪ (𝐹 ↾ (ℕ0 ∖ {0}))) = ({〈0, 〈0, 1〉〉} ∪ (𝐹 ↾ (ℕ0 ∖ {0}))) | |
| 20 | 16, 18, 19 | fvsnun1 7126 | . . . . 5 ⊢ (⊤ → (({〈0, 〈0, 1〉〉} ∪ (𝐹 ↾ (ℕ0 ∖ {0})))‘0) = 〈0, 1〉) |
| 21 | 20 | mptru 1548 | . . . 4 ⊢ (({〈0, 〈0, 1〉〉} ∪ (𝐹 ↾ (ℕ0 ∖ {0})))‘0) = 〈0, 1〉 |
| 22 | 14, 21 | eqtrdi 2785 | . . 3 ⊢ (𝜑 → (𝐶‘0) = 〈0, 1〉) |
| 23 | 3, 22 | seq1i 13936 | . 2 ⊢ (𝜑 → (seq0(𝐷, 𝐶)‘0) = 〈0, 1〉) |
| 24 | 2, 23 | eqtrid 2781 | 1 ⊢ (𝜑 → (𝐺‘0) = 〈0, 1〉) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ⊤wtru 1542 ∈ wcel 2113 Vcvv 3438 ⦋csb 3847 ∖ cdif 3896 ∪ cun 3897 ifcif 4477 {csn 4578 〈cop 4584 class class class wbr 5096 × cxp 5620 ↾ cres 5624 Fn wfn 6485 ⟶wf 6486 ‘cfv 6490 (class class class)co 7356 ∈ cmpo 7358 1st c1st 7929 2nd c2nd 7930 ℝcr 11023 0cc0 11024 1c1 11025 + caddc 11027 < clt 11164 / cdiv 11792 ℕcn 12143 2c2 12198 ℕ0cn0 12399 seqcseq 13922 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-cnex 11080 ax-resscn 11081 ax-1cn 11082 ax-icn 11083 ax-addcl 11084 ax-addrcl 11085 ax-mulcl 11086 ax-mulrcl 11087 ax-mulcom 11088 ax-addass 11089 ax-mulass 11090 ax-distr 11091 ax-i2m1 11092 ax-1ne0 11093 ax-1rid 11094 ax-rnegex 11095 ax-rrecex 11096 ax-cnre 11097 ax-pre-lttri 11098 ax-pre-lttrn 11099 ax-pre-ltadd 11100 ax-pre-mulgt0 11101 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-er 8633 df-en 8882 df-dom 8883 df-sdom 8884 df-pnf 11166 df-mnf 11167 df-xr 11168 df-ltxr 11169 df-le 11170 df-sub 11364 df-neg 11365 df-nn 12144 df-n0 12400 df-z 12487 df-uz 12750 df-seq 13923 |
| This theorem is referenced by: ruclem6 16158 ruclem8 16160 ruclem11 16163 |
| Copyright terms: Public domain | W3C validator |