|   | Metamath Proof Explorer | < Previous  
      Next > Nearby theorems | |
| Mirrors > Home > MPE Home > Th. List > sltmul12ad | Structured version Visualization version GIF version | ||
| Description: Comparison of the product of two positive surreals. (Contributed by Scott Fenton, 17-Apr-2025.) | 
| Ref | Expression | 
|---|---|
| sltmul12ad.1 | ⊢ (𝜑 → 𝐴 ∈ No ) | 
| sltmul12ad.2 | ⊢ (𝜑 → 𝐵 ∈ No ) | 
| sltmul12ad.3 | ⊢ (𝜑 → 𝐶 ∈ No ) | 
| sltmul12ad.4 | ⊢ (𝜑 → 𝐷 ∈ No ) | 
| sltmul12ad.5 | ⊢ (𝜑 → 0s ≤s 𝐴) | 
| sltmul12ad.6 | ⊢ (𝜑 → 𝐴 <s 𝐵) | 
| sltmul12ad.7 | ⊢ (𝜑 → 0s ≤s 𝐶) | 
| sltmul12ad.8 | ⊢ (𝜑 → 𝐶 <s 𝐷) | 
| Ref | Expression | 
|---|---|
| sltmul12ad | ⊢ (𝜑 → (𝐴 ·s 𝐶) <s (𝐵 ·s 𝐷)) | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | sltmul12ad.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ No ) | |
| 2 | sltmul12ad.3 | . . 3 ⊢ (𝜑 → 𝐶 ∈ No ) | |
| 3 | 1, 2 | mulscld 28161 | . 2 ⊢ (𝜑 → (𝐴 ·s 𝐶) ∈ No ) | 
| 4 | sltmul12ad.2 | . . 3 ⊢ (𝜑 → 𝐵 ∈ No ) | |
| 5 | 4, 2 | mulscld 28161 | . 2 ⊢ (𝜑 → (𝐵 ·s 𝐶) ∈ No ) | 
| 6 | sltmul12ad.4 | . . 3 ⊢ (𝜑 → 𝐷 ∈ No ) | |
| 7 | 4, 6 | mulscld 28161 | . 2 ⊢ (𝜑 → (𝐵 ·s 𝐷) ∈ No ) | 
| 8 | sltmul12ad.7 | . . 3 ⊢ (𝜑 → 0s ≤s 𝐶) | |
| 9 | sltmul12ad.6 | . . . 4 ⊢ (𝜑 → 𝐴 <s 𝐵) | |
| 10 | 1, 4, 9 | sltled 27814 | . . 3 ⊢ (𝜑 → 𝐴 ≤s 𝐵) | 
| 11 | 1, 4, 2, 8, 10 | slemul1ad 28208 | . 2 ⊢ (𝜑 → (𝐴 ·s 𝐶) ≤s (𝐵 ·s 𝐶)) | 
| 12 | sltmul12ad.8 | . . 3 ⊢ (𝜑 → 𝐶 <s 𝐷) | |
| 13 | 0sno 27871 | . . . . . 6 ⊢ 0s ∈ No | |
| 14 | 13 | a1i 11 | . . . . 5 ⊢ (𝜑 → 0s ∈ No ) | 
| 15 | sltmul12ad.5 | . . . . 5 ⊢ (𝜑 → 0s ≤s 𝐴) | |
| 16 | 14, 1, 4, 15, 9 | slelttrd 27806 | . . . 4 ⊢ (𝜑 → 0s <s 𝐵) | 
| 17 | 2, 6, 4, 16 | sltmul2d 28198 | . . 3 ⊢ (𝜑 → (𝐶 <s 𝐷 ↔ (𝐵 ·s 𝐶) <s (𝐵 ·s 𝐷))) | 
| 18 | 12, 17 | mpbid 232 | . 2 ⊢ (𝜑 → (𝐵 ·s 𝐶) <s (𝐵 ·s 𝐷)) | 
| 19 | 3, 5, 7, 11, 18 | slelttrd 27806 | 1 ⊢ (𝜑 → (𝐴 ·s 𝐶) <s (𝐵 ·s 𝐷)) | 
| Colors of variables: wff setvar class | 
| Syntax hints: → wi 4 ∈ wcel 2108 class class class wbr 5143 (class class class)co 7431 No csur 27684 <s cslt 27685 ≤s csle 27789 0s c0s 27867 ·s cmuls 28132 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-rep 5279 ax-sep 5296 ax-nul 5306 ax-pow 5365 ax-pr 5432 ax-un 7755 | 
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-ral 3062 df-rex 3071 df-rmo 3380 df-reu 3381 df-rab 3437 df-v 3482 df-sbc 3789 df-csb 3900 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-pss 3971 df-nul 4334 df-if 4526 df-pw 4602 df-sn 4627 df-pr 4629 df-tp 4631 df-op 4633 df-ot 4635 df-uni 4908 df-int 4947 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5226 df-tr 5260 df-id 5578 df-eprel 5584 df-po 5592 df-so 5593 df-fr 5637 df-se 5638 df-we 5639 df-xp 5691 df-rel 5692 df-cnv 5693 df-co 5694 df-dm 5695 df-rn 5696 df-res 5697 df-ima 5698 df-pred 6321 df-ord 6387 df-on 6388 df-suc 6390 df-iota 6514 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-1st 8014 df-2nd 8015 df-frecs 8306 df-wrecs 8337 df-recs 8411 df-1o 8506 df-2o 8507 df-nadd 8704 df-no 27687 df-slt 27688 df-bday 27689 df-sle 27790 df-sslt 27826 df-scut 27828 df-0s 27869 df-made 27886 df-old 27887 df-left 27889 df-right 27890 df-norec 27971 df-norec2 27982 df-adds 27993 df-negs 28053 df-subs 28054 df-muls 28133 | 
| This theorem is referenced by: remulscllem2 28433 | 
| Copyright terms: Public domain | W3C validator |