| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > avglts2d | Structured version Visualization version GIF version | ||
| Description: Ordering property for average. (Contributed by Scott Fenton, 11-Dec-2025.) |
| Ref | Expression |
|---|---|
| avgs.1 | ⊢ (𝜑 → 𝐴 ∈ No) |
| avgs.2 | ⊢ (𝜑 → 𝐵 ∈ No) |
| Ref | Expression |
|---|---|
| avglts2d | ⊢ (𝜑 → (𝐴 <s 𝐵 ↔ ((𝐴 +s 𝐵) /su 2s) <s 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | avgs.1 | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ No) | |
| 2 | avgs.2 | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ No) | |
| 3 | 1, 2, 2 | ltadds1d 28414 | . . . . 5 ⊢ (𝜑 → (𝐴 <s 𝐵 ↔ (𝐴 +s 𝐵) <s (𝐵 +s 𝐵))) |
| 4 | no2times 28833 | . . . . . . 7 ⊢ (𝐵 ∈ No → (2s ·s 𝐵) = (𝐵 +s 𝐵)) | |
| 5 | 2, 4 | syl 18 | . . . . . 6 ⊢ (𝜑 → (2s ·s 𝐵) = (𝐵 +s 𝐵)) |
| 6 | 5 | breq2d 5118 | . . . . 5 ⊢ (𝜑 → ((𝐴 +s 𝐵) <s (2s ·s 𝐵) ↔ (𝐴 +s 𝐵) <s (𝐵 +s 𝐵))) |
| 7 | 3, 6 | bitr4d 285 | . . . 4 ⊢ (𝜑 → (𝐴 <s 𝐵 ↔ (𝐴 +s 𝐵) <s (2s ·s 𝐵))) |
| 8 | 2no 28835 | . . . . . . 7 ⊢ 2s ∈ No | |
| 9 | exps1 28844 | . . . . . . 7 ⊢ (2s ∈ No → (2s↑s 1s ) = 2s) | |
| 10 | 8, 9 | ax-mp 5 | . . . . . 6 ⊢ (2s↑s 1s ) = 2s |
| 11 | 10 | oveq1i 7453 | . . . . 5 ⊢ ((2s↑s 1s ) ·s 𝐵) = (2s ·s 𝐵) |
| 12 | 11 | breq2i 5114 | . . . 4 ⊢ ((𝐴 +s 𝐵) <s ((2s↑s 1s ) ·s 𝐵) ↔ (𝐴 +s 𝐵) <s (2s ·s 𝐵)) |
| 13 | 7, 12 | bitr4di 292 | . . 3 ⊢ (𝜑 → (𝐴 <s 𝐵 ↔ (𝐴 +s 𝐵) <s ((2s↑s 1s ) ·s 𝐵))) |
| 14 | 1, 2 | addscld 28396 | . . . 4 ⊢ (𝜑 → (𝐴 +s 𝐵) ∈ No) |
| 15 | 1n0s 28764 | . . . . 5 ⊢ 1s ∈ ℕ0s | |
| 16 | 15 | a1i 11 | . . . 4 ⊢ (𝜑 → 1s ∈ ℕ0s) |
| 17 | 14, 2, 16 | pw2ltdivmulsd 28866 | . . 3 ⊢ (𝜑 → (((𝐴 +s 𝐵) /su (2s↑s 1s )) <s 𝐵 ↔ (𝐴 +s 𝐵) <s ((2s↑s 1s ) ·s 𝐵))) |
| 18 | 13, 17 | bitr4d 285 | . 2 ⊢ (𝜑 → (𝐴 <s 𝐵 ↔ ((𝐴 +s 𝐵) /su (2s↑s 1s )) <s 𝐵)) |
| 19 | 10 | oveq2i 7454 | . . 3 ⊢ ((𝐴 +s 𝐵) /su (2s↑s 1s )) = ((𝐴 +s 𝐵) /su 2s) |
| 20 | 19 | breq1i 5113 | . 2 ⊢ (((𝐴 +s 𝐵) /su (2s↑s 1s )) <s 𝐵 ↔ ((𝐴 +s 𝐵) /su 2s) <s 𝐵) |
| 21 | 18, 20 | bitrdi 290 | 1 ⊢ (𝜑 → (𝐴 <s 𝐵 ↔ ((𝐴 +s 𝐵) /su 2s) <s 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2147 class class class wbr 5106 (class class class)co 7443 Nocsur 28027 <s clts 28028 1s c1s 28222 +s cadds 28375 ·s cmuls 28522 /su cdivs 28603 ℕ0scn0s 28728 2sc2s 28826 ↑scexps 28828 |
| 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-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 |
| 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-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-tp 4593 df-op 4839 df-ot 4862 df-uni 4871 df-int 4911 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-se 5609 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6322 df-ord 6383 df-on 6384 df-lim 6385 df-suc 6386 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-riota 7400 df-ov 7446 df-oprab 7447 df-mpo 7448 df-om 7902 df-1st 8025 df-2nd 8026 df-frecs 8327 df-wrecs 8358 df-recs 8407 df-rdg 8446 df-1o 8504 df-2o 8505 df-oadd 8508 df-nadd 8703 df-no 28030 df-lts 28031 df-bday 28032 df-les 28132 df-slts 28174 df-cuts 28176 df-0s 28223 df-1s 28224 df-made 28243 df-old 28244 df-left 28246 df-right 28247 df-norec 28354 df-norec2 28365 df-adds 28376 df-negs 28437 df-subs 28438 df-muls 28523 df-divs 28604 df-seqs 28700 df-n0s 28730 df-nns 28731 df-zs 28795 df-2s 28827 df-exps 28829 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |