| 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 28408 | . 2 ⊢ (𝜑 → (𝐴 ·s 𝐶) ∈ No ) |
| 4 | ltmuls12ad.2 | . . 3 ⊢ (𝜑 → 𝐵 ∈ No ) | |
| 5 | 4, 2 | mulscld 28408 | . 2 ⊢ (𝜑 → (𝐵 ·s 𝐶) ∈ No ) |
| 6 | ltmuls12ad.4 | . . 3 ⊢ (𝜑 → 𝐷 ∈ No ) | |
| 7 | 4, 6 | mulscld 28408 | . 2 ⊢ (𝜑 → (𝐵 ·s 𝐷) ∈ No ) |
| 8 | ltmuls12ad.7 | . . 3 ⊢ (𝜑 → 0s ≤s 𝐶) | |
| 9 | ltmuls12ad.6 | . . . 4 ⊢ (𝜑 → 𝐴 <s 𝐵) | |
| 10 | 1, 4, 9 | ltlesd 28017 | . . 3 ⊢ (𝜑 → 𝐴 ≤s 𝐵) |
| 11 | 1, 4, 2, 8, 10 | lemuls1ad 28455 | . 2 ⊢ (𝜑 → (𝐴 ·s 𝐶) ≤s (𝐵 ·s 𝐶)) |
| 12 | ltmuls12ad.8 | . . 3 ⊢ (𝜑 → 𝐶 <s 𝐷) | |
| 13 | 0no 28082 | . . . . . 6 ⊢ 0s ∈ No | |
| 14 | 13 | a1i 11 | . . . . 5 ⊢ (𝜑 → 0s ∈ No ) |
| 15 | ltmuls12ad.5 | . . . . 5 ⊢ (𝜑 → 0s ≤s 𝐴) | |
| 16 | 14, 1, 4, 15, 9 | leltstrd 28009 | . . . 4 ⊢ (𝜑 → 0s <s 𝐵) |
| 17 | 2, 6, 4, 16 | ltmuls2d 28445 | . . 3 ⊢ (𝜑 → (𝐶 <s 𝐷 ↔ (𝐵 ·s 𝐶) <s (𝐵 ·s 𝐷))) |
| 18 | 12, 17 | mpbid 235 | . 2 ⊢ (𝜑 → (𝐵 ·s 𝐶) <s (𝐵 ·s 𝐷)) |
| 19 | 3, 5, 7, 11, 18 | leltstrd 28009 | 1 ⊢ (𝜑 → (𝐴 ·s 𝐶) <s (𝐵 ·s 𝐷)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∈ wcel 2145 class class class wbr 5107 (class class class)co 7417 No csur 27884 <s clts 27885 ≤s cles 27988 0s c0s 28078 ·s cmuls 28379 |
| 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 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4594 df-ot 4596 df-uni 4871 df-int 4911 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-se 5613 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7374 df-ov 7420 df-oprab 7421 df-mpo 7422 df-1st 7990 df-2nd 7991 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-1o 8459 df-2o 8460 df-nadd 8658 df-no 27887 df-lts 27888 df-bday 27889 df-les 27989 df-slts 28031 df-cuts 28033 df-0s 28080 df-made 28100 df-old 28101 df-left 28103 df-right 28104 df-norec 28211 df-norec2 28222 df-adds 28233 df-negs 28294 df-subs 28295 df-muls 28380 |
| This theorem is used by: remulscllem2 28774 |
| Copyright terms: Public domain | W3C validator |