| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ruclem10 | Structured version Visualization version GIF version | ||
| Description: Lemma for ruc 16455. Every first component of the 𝐺 sequence is less than every second component. That is, the sequences form a chain a1 < a2 <... < b2 < b1, where ai are the first components and bi are the second components. (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(𝐷, 𝐶) |
| ruclem10.6 | ⊢ (𝜑 → 𝑀 ∈ ℕ0) |
| ruclem10.7 | ⊢ (𝜑 → 𝑁 ∈ ℕ0) |
| Ref | Expression |
|---|---|
| ruclem10 | ⊢ (𝜑 → (1st ‘(𝐺‘𝑀)) < (2nd ‘(𝐺‘𝑁))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ruc.1 | . . . . 5 ⊢ (𝜑 → 𝐹:ℕ⟶ℝ) | |
| 2 | ruc.2 | . . . . 5 ⊢ (𝜑 → 𝐷 = (𝑥 ∈ (ℝ × ℝ), 𝑦 ∈ ℝ ↦ ⦋(((1st ‘𝑥) + (2nd ‘𝑥)) / 2) / 𝑚⦌if(𝑚 < 𝑦, 〈(1st ‘𝑥), 𝑚〉, 〈((𝑚 + (2nd ‘𝑥)) / 2), (2nd ‘𝑥)〉))) | |
| 3 | ruc.4 | . . . . 5 ⊢ 𝐶 = ({〈0, 〈0, 1〉〉} ∪ 𝐹) | |
| 4 | ruc.5 | . . . . 5 ⊢ 𝐺 = seq0(𝐷, 𝐶) | |
| 5 | 1, 2, 3, 4 | ruclem6 16447 | . . . 4 ⊢ (𝜑 → 𝐺:ℕ0⟶(ℝ × ℝ)) |
| 6 | ruclem10.6 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℕ0) | |
| 7 | 5, 6 | ffvelcdmd 7117 | . . 3 ⊢ (𝜑 → (𝐺‘𝑀) ∈ (ℝ × ℝ)) |
| 8 | xp1st 8067 | . . 3 ⊢ ((𝐺‘𝑀) ∈ (ℝ × ℝ) → (1st ‘(𝐺‘𝑀)) ∈ ℝ) | |
| 9 | 7, 8 | syl 18 | . 2 ⊢ (𝜑 → (1st ‘(𝐺‘𝑀)) ∈ ℝ) |
| 10 | ruclem10.7 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℕ0) | |
| 11 | 10, 6 | ifcld 4532 | . . . 4 ⊢ (𝜑 → if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ ℕ0) |
| 12 | 5, 11 | ffvelcdmd 7117 | . . 3 ⊢ (𝜑 → (𝐺‘if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∈ (ℝ × ℝ)) |
| 13 | xp1st 8067 | . . 3 ⊢ ((𝐺‘if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∈ (ℝ × ℝ) → (1st ‘(𝐺‘if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) ∈ ℝ) | |
| 14 | 12, 13 | syl 18 | . 2 ⊢ (𝜑 → (1st ‘(𝐺‘if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) ∈ ℝ) |
| 15 | 5, 10 | ffvelcdmd 7117 | . . 3 ⊢ (𝜑 → (𝐺‘𝑁) ∈ (ℝ × ℝ)) |
| 16 | xp2nd 8068 | . . 3 ⊢ ((𝐺‘𝑁) ∈ (ℝ × ℝ) → (2nd ‘(𝐺‘𝑁)) ∈ ℝ) | |
| 17 | 15, 16 | syl 18 | . 2 ⊢ (𝜑 → (2nd ‘(𝐺‘𝑁)) ∈ ℝ) |
| 18 | 6 | nn0red 12708 | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℝ) |
| 19 | 10 | nn0red 12708 | . . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℝ) |
| 20 | max1 13355 | . . . . . 6 ⊢ ((𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ) → 𝑀 ≤ if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) | |
| 21 | 18, 19, 20 | syl2anc 596 | . . . . 5 ⊢ (𝜑 → 𝑀 ≤ if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) |
| 22 | 6 | nn0zd 12758 | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| 23 | 11 | nn0zd 12758 | . . . . . 6 ⊢ (𝜑 → if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ ℤ) |
| 24 | eluz 13019 | . . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ ℤ) → (if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ (ℤ≥‘𝑀) ↔ 𝑀 ≤ if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) | |
| 25 | 22, 23, 24 | syl2anc 596 | . . . . 5 ⊢ (𝜑 → (if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ (ℤ≥‘𝑀) ↔ 𝑀 ≤ if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) |
| 26 | 21, 25 | mpbird 260 | . . . 4 ⊢ (𝜑 → if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ (ℤ≥‘𝑀)) |
| 27 | 1, 2, 3, 4, 6, 26 | ruclem9 16450 | . . 3 ⊢ (𝜑 → ((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) ∧ (2nd ‘(𝐺‘if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) ≤ (2nd ‘(𝐺‘𝑀)))) |
| 28 | 27 | simpld 500 | . 2 ⊢ (𝜑 → (1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘if(𝑀 ≤ 𝑁, 𝑁, 𝑀)))) |
| 29 | xp2nd 8068 | . . . 4 ⊢ ((𝐺‘if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) ∈ (ℝ × ℝ) → (2nd ‘(𝐺‘if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) ∈ ℝ) | |
| 30 | 12, 29 | syl 18 | . . 3 ⊢ (𝜑 → (2nd ‘(𝐺‘if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) ∈ ℝ) |
| 31 | 1, 2, 3, 4 | ruclem8 16449 | . . . 4 ⊢ ((𝜑 ∧ if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ ℕ0) → (1st ‘(𝐺‘if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) < (2nd ‘(𝐺‘if(𝑀 ≤ 𝑁, 𝑁, 𝑀)))) |
| 32 | 11, 31 | mpdan 700 | . . 3 ⊢ (𝜑 → (1st ‘(𝐺‘if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) < (2nd ‘(𝐺‘if(𝑀 ≤ 𝑁, 𝑁, 𝑀)))) |
| 33 | max2 13357 | . . . . . . 7 ⊢ ((𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ) → 𝑁 ≤ if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) | |
| 34 | 18, 19, 33 | syl2anc 596 | . . . . . 6 ⊢ (𝜑 → 𝑁 ≤ if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) |
| 35 | 10 | nn0zd 12758 | . . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| 36 | eluz 13019 | . . . . . . 7 ⊢ ((𝑁 ∈ ℤ ∧ if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ ℤ) → (if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ (ℤ≥‘𝑁) ↔ 𝑁 ≤ if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) | |
| 37 | 35, 23, 36 | syl2anc 596 | . . . . . 6 ⊢ (𝜑 → (if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ (ℤ≥‘𝑁) ↔ 𝑁 ≤ if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) |
| 38 | 34, 37 | mpbird 260 | . . . . 5 ⊢ (𝜑 → if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ (ℤ≥‘𝑁)) |
| 39 | 1, 2, 3, 4, 10, 38 | ruclem9 16450 | . . . 4 ⊢ (𝜑 → ((1st ‘(𝐺‘𝑁)) ≤ (1st ‘(𝐺‘if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) ∧ (2nd ‘(𝐺‘if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) ≤ (2nd ‘(𝐺‘𝑁)))) |
| 40 | 39 | simprd 501 | . . 3 ⊢ (𝜑 → (2nd ‘(𝐺‘if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) ≤ (2nd ‘(𝐺‘𝑁))) |
| 41 | 14, 30, 17, 32, 40 | ltletrd 11509 | . 2 ⊢ (𝜑 → (1st ‘(𝐺‘if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) < (2nd ‘(𝐺‘𝑁))) |
| 42 | 9, 14, 17, 28, 41 | lelttrd 11507 | 1 ⊢ (𝜑 → (1st ‘(𝐺‘𝑀)) < (2nd ‘(𝐺‘𝑁))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2147 ⦋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 ≤ cle 11383 / cdiv 12013 ℕcn 12375 2c2 12437 ℕ0cn0 12646 ℤcz 12733 ℤ≥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-rmo 3369 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-1st 8035 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-div 12014 df-nn 12376 df-2 12445 df-n0 12647 df-z 12734 df-uz 13006 df-fz 13680 df-seq 14185 |
| This theorem is used by: ruclem11 16452 ruclem12 16453 |
| Copyright terms: Public domain | W3C validator |