| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > avgslt1d | 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 |
|---|---|
| avgslt1d | ⊢ (𝜑 → (𝐴 <s 𝐵 ↔ 𝐴 <s ((𝐴 +s 𝐵) /su 2s))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | avgs.1 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ No ) | |
| 2 | avgs.2 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ No ) | |
| 3 | 1, 2, 1 | sltadd2d 27967 | . . . 4 ⊢ (𝜑 → (𝐴 <s 𝐵 ↔ (𝐴 +s 𝐴) <s (𝐴 +s 𝐵))) |
| 4 | no2times 28375 | . . . . . 6 ⊢ (𝐴 ∈ No → (2s ·s 𝐴) = (𝐴 +s 𝐴)) | |
| 5 | 1, 4 | syl 17 | . . . . 5 ⊢ (𝜑 → (2s ·s 𝐴) = (𝐴 +s 𝐴)) |
| 6 | 5 | breq1d 5106 | . . . 4 ⊢ (𝜑 → ((2s ·s 𝐴) <s (𝐴 +s 𝐵) ↔ (𝐴 +s 𝐴) <s (𝐴 +s 𝐵))) |
| 7 | 3, 6 | bitr4d 282 | . . 3 ⊢ (𝜑 → (𝐴 <s 𝐵 ↔ (2s ·s 𝐴) <s (𝐴 +s 𝐵))) |
| 8 | 2sno 28377 | . . . . . 6 ⊢ 2s ∈ No | |
| 9 | exps1 28386 | . . . . . 6 ⊢ (2s ∈ No → (2s↑s 1s ) = 2s) | |
| 10 | 8, 9 | ax-mp 5 | . . . . 5 ⊢ (2s↑s 1s ) = 2s |
| 11 | 10 | oveq1i 7366 | . . . 4 ⊢ ((2s↑s 1s ) ·s 𝐴) = (2s ·s 𝐴) |
| 12 | 11 | breq1i 5103 | . . 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 27950 | . . . 4 ⊢ (𝜑 → (𝐴 +s 𝐵) ∈ No ) |
| 15 | 1n0s 28308 | . . . . 5 ⊢ 1s ∈ ℕ0s | |
| 16 | 15 | a1i 11 | . . . 4 ⊢ (𝜑 → 1s ∈ ℕ0s) |
| 17 | 1, 14, 16 | pw2sltmuldiv2d 28409 | . . 3 ⊢ (𝜑 → (((2s↑s 1s ) ·s 𝐴) <s (𝐴 +s 𝐵) ↔ 𝐴 <s ((𝐴 +s 𝐵) /su (2s↑s 1s )))) |
| 18 | 10 | oveq2i 7367 | . . . 4 ⊢ ((𝐴 +s 𝐵) /su (2s↑s 1s )) = ((𝐴 +s 𝐵) /su 2s) |
| 19 | 18 | breq2i 5104 | . . 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 5096 (class class class)co 7356 No csur 27605 <s cslt 27606 1s c1s 27794 +s cadds 27929 ·s cmuls 28075 /su cdivs 28156 ℕ0scnn0s 28273 2sc2s 28368 ↑scexps 28370 |
| 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-rep 5222 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 |
| 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-ral 3050 df-rex 3059 df-rmo 3348 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-tp 4583 df-op 4585 df-ot 4587 df-uni 4862 df-int 4901 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-se 5576 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-1st 7931 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-2o 8396 df-oadd 8399 df-nadd 8592 df-no 27608 df-slt 27609 df-bday 27610 df-sle 27711 df-sslt 27748 df-scut 27750 df-0s 27795 df-1s 27796 df-made 27815 df-old 27816 df-left 27818 df-right 27819 df-norec 27908 df-norec2 27919 df-adds 27930 df-negs 27990 df-subs 27991 df-muls 28076 df-divs 28157 df-seqs 28245 df-n0s 28275 df-nns 28276 df-zs 28337 df-2s 28369 df-exps 28371 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |