Mathbox for Scott Fenton |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > sletr | Structured version Visualization version GIF version |
Description: Surreal transitive law. (Contributed by Scott Fenton, 8-Dec-2021.) |
Ref | Expression |
---|---|
sletr | ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → ((𝐴 ≤s 𝐵 ∧ 𝐵 ≤s 𝐶) → 𝐴 ≤s 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sltletr 33230 | . . . . . . 7 ⊢ ((𝐶 ∈ No ∧ 𝐴 ∈ No ∧ 𝐵 ∈ No ) → ((𝐶 <s 𝐴 ∧ 𝐴 ≤s 𝐵) → 𝐶 <s 𝐵)) | |
2 | 1 | 3coml 1123 | . . . . . 6 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → ((𝐶 <s 𝐴 ∧ 𝐴 ≤s 𝐵) → 𝐶 <s 𝐵)) |
3 | 2 | expcomd 419 | . . . . 5 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → (𝐴 ≤s 𝐵 → (𝐶 <s 𝐴 → 𝐶 <s 𝐵))) |
4 | 3 | imp 409 | . . . 4 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ 𝐴 ≤s 𝐵) → (𝐶 <s 𝐴 → 𝐶 <s 𝐵)) |
5 | 4 | con3d 155 | . . 3 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ 𝐴 ≤s 𝐵) → (¬ 𝐶 <s 𝐵 → ¬ 𝐶 <s 𝐴)) |
6 | 5 | expimpd 456 | . 2 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → ((𝐴 ≤s 𝐵 ∧ ¬ 𝐶 <s 𝐵) → ¬ 𝐶 <s 𝐴)) |
7 | slenlt 33226 | . . . 4 ⊢ ((𝐵 ∈ No ∧ 𝐶 ∈ No ) → (𝐵 ≤s 𝐶 ↔ ¬ 𝐶 <s 𝐵)) | |
8 | 7 | 3adant1 1126 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → (𝐵 ≤s 𝐶 ↔ ¬ 𝐶 <s 𝐵)) |
9 | 8 | anbi2d 630 | . 2 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → ((𝐴 ≤s 𝐵 ∧ 𝐵 ≤s 𝐶) ↔ (𝐴 ≤s 𝐵 ∧ ¬ 𝐶 <s 𝐵))) |
10 | slenlt 33226 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝐶 ∈ No ) → (𝐴 ≤s 𝐶 ↔ ¬ 𝐶 <s 𝐴)) | |
11 | 10 | 3adant2 1127 | . 2 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → (𝐴 ≤s 𝐶 ↔ ¬ 𝐶 <s 𝐴)) |
12 | 6, 9, 11 | 3imtr4d 296 | 1 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → ((𝐴 ≤s 𝐵 ∧ 𝐵 ≤s 𝐶) → 𝐴 ≤s 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1083 ∈ wcel 2110 class class class wbr 5059 No csur 33142 <s cslt 33143 ≤s csle 33218 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5322 ax-un 7455 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3497 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4562 df-pr 4564 df-tp 4566 df-op 4568 df-uni 4833 df-br 5060 df-opab 5122 df-mpt 5140 df-tr 5166 df-id 5455 df-eprel 5460 df-po 5469 df-so 5470 df-fr 5509 df-we 5511 df-xp 5556 df-rel 5557 df-cnv 5558 df-co 5559 df-dm 5560 df-rn 5561 df-res 5562 df-ima 5563 df-ord 6189 df-on 6190 df-suc 6192 df-iota 6309 df-fun 6352 df-fn 6353 df-f 6354 df-fv 6358 df-1o 8096 df-2o 8097 df-no 33145 df-slt 33146 df-sle 33219 |
This theorem is referenced by: sletrd 33236 |
Copyright terms: Public domain | W3C validator |