| 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 28389 | . . . 4 ⊢ (𝜑 → (𝐴 <s 𝐵 ↔ (𝐴 +s 𝐴) <s (𝐴 +s 𝐵))) |
| 4 | no2times 28809 | . . . . . 6 ⊢ (𝐴 ∈ No → (2s ·s 𝐴) = (𝐴 +s 𝐴)) | |
| 5 | 1, 4 | syl 18 | . . . . 5 ⊢ (𝜑 → (2s ·s 𝐴) = (𝐴 +s 𝐴)) |
| 6 | 5 | breq1d 5112 | . . . 4 ⊢ (𝜑 → ((2s ·s 𝐴) <s (𝐴 +s 𝐵) ↔ (𝐴 +s 𝐴) <s (𝐴 +s 𝐵))) |
| 7 | 3, 6 | bitr4d 285 | . . 3 ⊢ (𝜑 → (𝐴 <s 𝐵 ↔ (2s ·s 𝐴) <s (𝐴 +s 𝐵))) |
| 8 | 2no 28811 | . . . . . 6 ⊢ 2s ∈ No | |
| 9 | exps1 28820 | . . . . . 6 ⊢ (2s ∈ No → (2s↑s 1s ) = 2s) | |
| 10 | 8, 9 | ax-mp 5 | . . . . 5 ⊢ (2s↑s 1s ) = 2s |
| 11 | 10 | oveq1i 7431 | . . . 4 ⊢ ((2s↑s 1s ) ·s 𝐴) = (2s ·s 𝐴) |
| 12 | 11 | breq1i 5109 | . . 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 28372 | . . . 4 ⊢ (𝜑 → (𝐴 +s 𝐵) ∈ No) |
| 15 | 1n0s 28740 | . . . . 5 ⊢ 1s ∈ ℕ0s | |
| 16 | 15 | a1i 11 | . . . 4 ⊢ (𝜑 → 1s ∈ ℕ0s) |
| 17 | 1, 14, 16 | pw2ltmuldivs2d 28843 | . . 3 ⊢ (𝜑 → (((2s↑s 1s ) ·s 𝐴) <s (𝐴 +s 𝐵) ↔ 𝐴 <s ((𝐴 +s 𝐵) /su (2s↑s 1s )))) |
| 18 | 10 | oveq2i 7432 | . . . 4 ⊢ ((𝐴 +s 𝐵) /su (2s↑s 1s )) = ((𝐴 +s 𝐵) /su 2s) |
| 19 | 18 | breq2i 5110 | . . 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 |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1569 ∈ wcel 2144 class class class wbr 5102 (class class class)co 7421 Nocsur 28003 <s clts 28004 1s c1s 28198 +s cadds 28351 ·s cmuls 28498 /su cdivs 28579 ℕ0scn0s 28704 2sc2s 28802 ↑scexps 28804 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7752 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4835 df-ot 4858 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-se 5604 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-riota 7378 df-ov 7424 df-oprab 7425 df-mpo 7426 df-om 7879 df-1st 8002 df-2nd 8003 df-frecs 8303 df-wrecs 8334 df-recs 8383 df-rdg 8422 df-1o 8480 df-2o 8481 df-oadd 8484 df-nadd 8679 df-no 28006 df-lts 28007 df-bday 28008 df-les 28108 df-slts 28150 df-cuts 28152 df-0s 28199 df-1s 28200 df-made 28219 df-old 28220 df-left 28222 df-right 28223 df-norec 28330 df-norec2 28341 df-adds 28352 df-negs 28413 df-subs 28414 df-muls 28499 df-divs 28580 df-seqs 28676 df-n0s 28706 df-nns 28707 df-zs 28771 df-2s 28803 df-exps 28805 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |