| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ltmuls12ad | Structured version Visualization version GIF version | ||
| Description: Comparison of the product of two positive surreals. (Contributed by Scott Fenton, 17-Apr-2025.) |
| Ref | Expression |
|---|---|
| ltmuls12ad.1 | ⊢ (𝜑 → 𝐴 ∈ No ) |
| ltmuls12ad.2 | ⊢ (𝜑 → 𝐵 ∈ No ) |
| ltmuls12ad.3 | ⊢ (𝜑 → 𝐶 ∈ No ) |
| ltmuls12ad.4 | ⊢ (𝜑 → 𝐷 ∈ No ) |
| ltmuls12ad.5 | ⊢ (𝜑 → 0s ≤s 𝐴) |
| ltmuls12ad.6 | ⊢ (𝜑 → 𝐴 <s 𝐵) |
| ltmuls12ad.7 | ⊢ (𝜑 → 0s ≤s 𝐶) |
| ltmuls12ad.8 | ⊢ (𝜑 → 𝐶 <s 𝐷) |
| Ref | Expression |
|---|---|
| ltmuls12ad | ⊢ (𝜑 → (𝐴 ·s 𝐶) <s (𝐵 ·s 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ltmuls12ad.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ No ) | |
| 2 | ltmuls12ad.3 | . . 3 ⊢ (𝜑 → 𝐶 ∈ No ) | |
| 3 | 1, 2 | mulscld 28503 | . 2 ⊢ (𝜑 → (𝐴 ·s 𝐶) ∈ No ) |
| 4 | ltmuls12ad.2 | . . 3 ⊢ (𝜑 → 𝐵 ∈ No ) | |
| 5 | 4, 2 | mulscld 28503 | . 2 ⊢ (𝜑 → (𝐵 ·s 𝐶) ∈ No ) |
| 6 | ltmuls12ad.4 | . . 3 ⊢ (𝜑 → 𝐷 ∈ No ) | |
| 7 | 4, 6 | mulscld 28503 | . 2 ⊢ (𝜑 → (𝐵 ·s 𝐷) ∈ No ) |
| 8 | ltmuls12ad.7 | . . 3 ⊢ (𝜑 → 0s ≤s 𝐶) | |
| 9 | ltmuls12ad.6 | . . . 4 ⊢ (𝜑 → 𝐴 <s 𝐵) | |
| 10 | 1, 4, 9 | ltlesd 28112 | . . 3 ⊢ (𝜑 → 𝐴 ≤s 𝐵) |
| 11 | 1, 4, 2, 8, 10 | lemuls1ad 28550 | . 2 ⊢ (𝜑 → (𝐴 ·s 𝐶) ≤s (𝐵 ·s 𝐶)) |
| 12 | ltmuls12ad.8 | . . 3 ⊢ (𝜑 → 𝐶 <s 𝐷) | |
| 13 | 0no 28177 | . . . . . 6 ⊢ 0s ∈ No | |
| 14 | 13 | a1i 11 | . . . . 5 ⊢ (𝜑 → 0s ∈ No ) |
| 15 | ltmuls12ad.5 | . . . . 5 ⊢ (𝜑 → 0s ≤s 𝐴) | |
| 16 | 14, 1, 4, 15, 9 | leltstrd 28104 | . . . 4 ⊢ (𝜑 → 0s <s 𝐵) |
| 17 | 2, 6, 4, 16 | ltmuls2d 28540 | . . 3 ⊢ (𝜑 → (𝐶 <s 𝐷 ↔ (𝐵 ·s 𝐶) <s (𝐵 ·s 𝐷))) |
| 18 | 12, 17 | mpbid 235 | . 2 ⊢ (𝜑 → (𝐵 ·s 𝐶) <s (𝐵 ·s 𝐷)) |
| 19 | 3, 5, 7, 11, 18 | leltstrd 28104 | 1 ⊢ (𝜑 → (𝐴 ·s 𝐶) <s (𝐵 ·s 𝐷)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∈ wcel 2145 class class class wbr 5103 (class class class)co 7412 No csur 27979 <s clts 27980 ≤s cles 28083 0s c0s 28173 ·s cmuls 28474 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 |
| 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 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-ot 4593 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 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 6297 df-ord 6358 df-on 6359 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-1st 7990 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-1o 8460 df-2o 8461 df-nadd 8659 df-no 27982 df-lts 27983 df-bday 27984 df-les 28084 df-slts 28126 df-cuts 28128 df-0s 28175 df-made 28195 df-old 28196 df-left 28198 df-right 28199 df-norec 28306 df-norec2 28317 df-adds 28328 df-negs 28389 df-subs 28390 df-muls 28475 |
| This theorem is used by: remulscllem2 28869 |
| Copyright terms: Public domain | W3C validator |