| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > avglts1d | 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 |
|---|---|
| avglts1d | ⊢ (𝜑 → (𝐴 <s 𝐵 ↔ 𝐴 <s ((𝐴 +s 𝐵) /su 2s))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | avgs.1 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ No ) | |
| 2 | avgs.2 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ No ) | |
| 3 | 1, 2, 1 | ltadds2d 28144 | . . . 4 ⊢ (𝜑 → (𝐴 <s 𝐵 ↔ (𝐴 +s 𝐴) <s (𝐴 +s 𝐵))) |
| 4 | no2times 28564 | . . . . . 6 ⊢ (𝐴 ∈ No → (2s ·s 𝐴) = (𝐴 +s 𝐴)) | |
| 5 | 1, 4 | syl 18 | . . . . 5 ⊢ (𝜑 → (2s ·s 𝐴) = (𝐴 +s 𝐴)) |
| 6 | 5 | breq1d 5114 | . . . 4 ⊢ (𝜑 → ((2s ·s 𝐴) <s (𝐴 +s 𝐵) ↔ (𝐴 +s 𝐴) <s (𝐴 +s 𝐵))) |
| 7 | 3, 6 | bitr4d 285 | . . 3 ⊢ (𝜑 → (𝐴 <s 𝐵 ↔ (2s ·s 𝐴) <s (𝐴 +s 𝐵))) |
| 8 | 2no 28566 | . . . . . 6 ⊢ 2s ∈ No | |
| 9 | exps1 28575 | . . . . . 6 ⊢ (2s ∈ No → (2s↑s 1s ) = 2s) | |
| 10 | 8, 9 | ax-mp 5 | . . . . 5 ⊢ (2s↑s 1s ) = 2s |
| 11 | 10 | oveq1i 7410 | . . . 4 ⊢ ((2s↑s 1s ) ·s 𝐴) = (2s ·s 𝐴) |
| 12 | 11 | breq1i 5111 | . . 3 ⊢ (((2s↑s 1s ) ·s 𝐴) <s (𝐴 +s 𝐵) ↔ (2s ·s 𝐴) <s (𝐴 +s 𝐵)) |
| 13 | 7, 12 | bitr4di 292 | . 2 ⊢ (𝜑 → (𝐴 <s 𝐵 ↔ ((2s↑s 1s ) ·s 𝐴) <s (𝐴 +s 𝐵))) |
| 14 | 1, 2 | addscld 28127 | . . . 4 ⊢ (𝜑 → (𝐴 +s 𝐵) ∈ No ) |
| 15 | 1n0s 28495 | . . . . 5 ⊢ 1s ∈ ℕ0s | |
| 16 | 15 | a1i 11 | . . . 4 ⊢ (𝜑 → 1s ∈ ℕ0s) |
| 17 | 1, 14, 16 | pw2ltmuldivs2d 28598 | . . 3 ⊢ (𝜑 → (((2s↑s 1s ) ·s 𝐴) <s (𝐴 +s 𝐵) ↔ 𝐴 <s ((𝐴 +s 𝐵) /su (2s↑s 1s )))) |
| 18 | 10 | oveq2i 7411 | . . . 4 ⊢ ((𝐴 +s 𝐵) /su (2s↑s 1s )) = ((𝐴 +s 𝐵) /su 2s) |
| 19 | 18 | breq2i 5112 | . . 3 ⊢ (𝐴 <s ((𝐴 +s 𝐵) /su (2s↑s 1s )) ↔ 𝐴 <s ((𝐴 +s 𝐵) /su 2s)) |
| 20 | 17, 19 | bitrdi 290 | . 2 ⊢ (𝜑 → (((2s↑s 1s ) ·s 𝐴) <s (𝐴 +s 𝐵) ↔ 𝐴 <s ((𝐴 +s 𝐵) /su 2s))) |
| 21 | 13, 20 | bitrd 282 | 1 ⊢ (𝜑 → (𝐴 <s 𝐵 ↔ 𝐴 <s ((𝐴 +s 𝐵) /su 2s))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 = wceq 1563 ∈ wcel 2145 class class class wbr 5104 (class class class)co 7400 No csur 27758 <s clts 27759 1s c1s 27953 +s cadds 28106 ·s cmuls 28253 /su cdivs 28334 ℕ0scn0s 28459 2sc2s 28557 ↑scexps 28559 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5231 ax-sep 5250 ax-nul 5260 ax-pow 5326 ax-pr 5394 ax-un 7722 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-tp 4590 df-op 4592 df-ot 4594 df-uni 4868 df-int 4908 df-iun 4953 df-br 5105 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-se 5605 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6291 df-ord 6352 df-on 6353 df-lim 6354 df-suc 6355 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-1st 7974 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-1o 8441 df-2o 8442 df-oadd 8445 df-nadd 8640 df-no 27761 df-lts 27762 df-bday 27763 df-les 27863 df-slts 27905 df-cuts 27907 df-0s 27954 df-1s 27955 df-made 27974 df-old 27975 df-left 27977 df-right 27978 df-norec 28085 df-norec2 28096 df-adds 28107 df-negs 28168 df-subs 28169 df-muls 28254 df-divs 28335 df-seqs 28431 df-n0s 28461 df-nns 28462 df-zs 28526 df-2s 28558 df-exps 28560 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |