| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ltadds2d | Structured version Visualization version GIF version | ||
| Description: Addition to both sides of surreal less-than. (Contributed by Scott Fenton, 21-Jan-2025.) |
| Ref | Expression |
|---|---|
| addscand.1 | ⊢ (𝜑 → 𝐴 ∈ No ) |
| addscand.2 | ⊢ (𝜑 → 𝐵 ∈ No ) |
| addscand.3 | ⊢ (𝜑 → 𝐶 ∈ No ) |
| Ref | Expression |
|---|---|
| ltadds2d | ⊢ (𝜑 → (𝐴 <s 𝐵 ↔ (𝐶 +s 𝐴) <s (𝐶 +s 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | addscand.1 | . 2 ⊢ (𝜑 → 𝐴 ∈ No ) | |
| 2 | addscand.2 | . 2 ⊢ (𝜑 → 𝐵 ∈ No ) | |
| 3 | addscand.3 | . 2 ⊢ (𝜑 → 𝐶 ∈ No ) | |
| 4 | ltadds2 27987 | . 2 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → (𝐴 <s 𝐵 ↔ (𝐶 +s 𝐴) <s (𝐶 +s 𝐵))) | |
| 5 | 1, 2, 3, 4 | syl3anc 1373 | 1 ⊢ (𝜑 → (𝐴 <s 𝐵 ↔ (𝐶 +s 𝐴) <s (𝐶 +s 𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∈ wcel 2113 class class class wbr 5098 (class class class)co 7358 No csur 27607 <s clts 27608 +s cadds 27955 |
| 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 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 |
| 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-tp 4585 df-op 4587 df-ot 4589 df-uni 4864 df-int 4903 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-se 5578 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-1o 8397 df-2o 8398 df-nadd 8594 df-no 27610 df-lts 27611 df-bday 27612 df-les 27713 df-slts 27754 df-cuts 27756 df-0s 27803 df-made 27823 df-old 27824 df-left 27826 df-right 27827 df-norec2 27945 df-adds 27956 |
| This theorem is referenced by: addsuniflem 27997 ltaddspos1d 28007 lt2addsd 28009 ltsp1d 28011 negsid 28037 ltsubs2 28073 mulsproplem5 28116 mulsproplem6 28117 mulsproplem7 28118 mulsproplem8 28119 addonbday 28275 avglts1d 28449 halfcut 28454 addhalfcut 28455 pw2cut2 28458 bdayfinbndlem1 28463 recut 28490 |
| Copyright terms: Public domain | W3C validator |