| 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 27993 | . . . 4 ⊢ (𝜑 → (𝐴 <s 𝐵 ↔ (𝐴 +s 𝐴) <s (𝐴 +s 𝐵))) |
| 4 | no2times 28413 | . . . . . 6 ⊢ (𝐴 ∈ No → (2s ·s 𝐴) = (𝐴 +s 𝐴)) | |
| 5 | 1, 4 | syl 17 | . . . . 5 ⊢ (𝜑 → (2s ·s 𝐴) = (𝐴 +s 𝐴)) |
| 6 | 5 | breq1d 5108 | . . . 4 ⊢ (𝜑 → ((2s ·s 𝐴) <s (𝐴 +s 𝐵) ↔ (𝐴 +s 𝐴) <s (𝐴 +s 𝐵))) |
| 7 | 3, 6 | bitr4d 282 | . . 3 ⊢ (𝜑 → (𝐴 <s 𝐵 ↔ (2s ·s 𝐴) <s (𝐴 +s 𝐵))) |
| 8 | 2no 28415 | . . . . . 6 ⊢ 2s ∈ No | |
| 9 | exps1 28424 | . . . . . 6 ⊢ (2s ∈ No → (2s↑s 1s ) = 2s) | |
| 10 | 8, 9 | ax-mp 5 | . . . . 5 ⊢ (2s↑s 1s ) = 2s |
| 11 | 10 | oveq1i 7368 | . . . 4 ⊢ ((2s↑s 1s ) ·s 𝐴) = (2s ·s 𝐴) |
| 12 | 11 | breq1i 5105 | . . 3 ⊢ (((2s↑s 1s ) ·s 𝐴) <s (𝐴 +s 𝐵) ↔ (2s ·s 𝐴) <s (𝐴 +s 𝐵)) |
| 13 | 7, 12 | bitr4di 289 | . 2 ⊢ (𝜑 → (𝐴 <s 𝐵 ↔ ((2s↑s 1s ) ·s 𝐴) <s (𝐴 +s 𝐵))) |
| 14 | 1, 2 | addscld 27976 | . . . 4 ⊢ (𝜑 → (𝐴 +s 𝐵) ∈ No ) |
| 15 | 1n0s 28344 | . . . . 5 ⊢ 1s ∈ ℕ0s | |
| 16 | 15 | a1i 11 | . . . 4 ⊢ (𝜑 → 1s ∈ ℕ0s) |
| 17 | 1, 14, 16 | pw2ltmuldivs2d 28447 | . . 3 ⊢ (𝜑 → (((2s↑s 1s ) ·s 𝐴) <s (𝐴 +s 𝐵) ↔ 𝐴 <s ((𝐴 +s 𝐵) /su (2s↑s 1s )))) |
| 18 | 10 | oveq2i 7369 | . . . 4 ⊢ ((𝐴 +s 𝐵) /su (2s↑s 1s )) = ((𝐴 +s 𝐵) /su 2s) |
| 19 | 18 | breq2i 5106 | . . 3 ⊢ (𝐴 <s ((𝐴 +s 𝐵) /su (2s↑s 1s )) ↔ 𝐴 <s ((𝐴 +s 𝐵) /su 2s)) |
| 20 | 17, 19 | bitrdi 287 | . 2 ⊢ (𝜑 → (((2s↑s 1s ) ·s 𝐴) <s (𝐴 +s 𝐵) ↔ 𝐴 <s ((𝐴 +s 𝐵) /su 2s))) |
| 21 | 13, 20 | bitrd 279 | 1 ⊢ (𝜑 → (𝐴 <s 𝐵 ↔ 𝐴 <s ((𝐴 +s 𝐵) /su 2s))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1541 ∈ wcel 2113 class class class wbr 5098 (class class class)co 7358 No csur 27607 <s clts 27608 1s c1s 27802 +s cadds 27955 ·s cmuls 28102 /su cdivs 28183 ℕ0scn0s 28308 2sc2s 28406 ↑scexps 28408 |
| 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 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 |
| 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-tp 4585 df-op 4587 df-ot 4589 df-uni 4864 df-int 4903 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-se 5578 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-2o 8398 df-oadd 8401 df-nadd 8594 df-no 27610 df-lts 27611 df-bday 27612 df-les 27713 df-slts 27754 df-cuts 27756 df-0s 27803 df-1s 27804 df-made 27823 df-old 27824 df-left 27826 df-right 27827 df-norec 27934 df-norec2 27945 df-adds 27956 df-negs 28017 df-subs 28018 df-muls 28103 df-divs 28184 df-seqs 28280 df-n0s 28310 df-nns 28311 df-zs 28375 df-2s 28407 df-exps 28409 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |