![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > 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 27186 | . . . . . . 7 ⊢ ((𝐶 ∈ No ∧ 𝐴 ∈ No ∧ 𝐵 ∈ No ) → ((𝐶 <s 𝐴 ∧ 𝐴 ≤s 𝐵) → 𝐶 <s 𝐵)) | |
2 | 1 | 3coml 1127 | . . . . . 6 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → ((𝐶 <s 𝐴 ∧ 𝐴 ≤s 𝐵) → 𝐶 <s 𝐵)) |
3 | 2 | expcomd 417 | . . . . 5 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → (𝐴 ≤s 𝐵 → (𝐶 <s 𝐴 → 𝐶 <s 𝐵))) |
4 | 3 | imp 407 | . . . 4 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ 𝐴 ≤s 𝐵) → (𝐶 <s 𝐴 → 𝐶 <s 𝐵)) |
5 | 4 | con3d 152 | . . 3 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ 𝐴 ≤s 𝐵) → (¬ 𝐶 <s 𝐵 → ¬ 𝐶 <s 𝐴)) |
6 | 5 | expimpd 454 | . 2 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → ((𝐴 ≤s 𝐵 ∧ ¬ 𝐶 <s 𝐵) → ¬ 𝐶 <s 𝐴)) |
7 | slenlt 27182 | . . . 4 ⊢ ((𝐵 ∈ No ∧ 𝐶 ∈ No ) → (𝐵 ≤s 𝐶 ↔ ¬ 𝐶 <s 𝐵)) | |
8 | 7 | 3adant1 1130 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → (𝐵 ≤s 𝐶 ↔ ¬ 𝐶 <s 𝐵)) |
9 | 8 | anbi2d 629 | . 2 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → ((𝐴 ≤s 𝐵 ∧ 𝐵 ≤s 𝐶) ↔ (𝐴 ≤s 𝐵 ∧ ¬ 𝐶 <s 𝐵))) |
10 | slenlt 27182 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝐶 ∈ No ) → (𝐴 ≤s 𝐶 ↔ ¬ 𝐶 <s 𝐴)) | |
11 | 10 | 3adant2 1131 | . 2 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → (𝐴 ≤s 𝐶 ↔ ¬ 𝐶 <s 𝐴)) |
12 | 6, 9, 11 | 3imtr4d 293 | 1 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → ((𝐴 ≤s 𝐵 ∧ 𝐵 ≤s 𝐶) → 𝐴 ≤s 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1087 ∈ wcel 2106 class class class wbr 5141 No csur 27070 <s cslt 27071 ≤s csle 27174 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2702 ax-sep 5292 ax-nul 5299 ax-pr 5420 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-ral 3061 df-rex 3070 df-rab 3432 df-v 3475 df-sbc 3774 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3963 df-nul 4319 df-if 4523 df-pw 4598 df-sn 4623 df-pr 4625 df-tp 4627 df-op 4629 df-uni 4902 df-br 5142 df-opab 5204 df-mpt 5225 df-tr 5259 df-id 5567 df-eprel 5573 df-po 5581 df-so 5582 df-fr 5624 df-we 5626 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-ord 6356 df-on 6357 df-suc 6359 df-iota 6484 df-fun 6534 df-fn 6535 df-f 6536 df-fv 6540 df-1o 8448 df-2o 8449 df-no 27073 df-slt 27074 df-sle 27175 |
This theorem is referenced by: sletrd 27192 |
Copyright terms: Public domain | W3C validator |