| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ltstrieq2 | Structured version Visualization version GIF version | ||
| Description: Trichotomy law for surreal less-than. (Contributed by Scott Fenton, 22-Apr-2012.) |
| Ref | Expression |
|---|---|
| ltstrieq2 | ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No) → (𝐴 = 𝐵 ↔ (¬ 𝐴 <s 𝐵 ∧ ¬ 𝐵 <s 𝐴))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ltsso 28039 | . 2 ⊢ <s Or No | |
| 2 | sotrieq2 5590 | . 2 ⊢ (( <s Or No ∧ (𝐴 ∈ No ∧ 𝐵 ∈ No)) → (𝐴 = 𝐵 ↔ (¬ 𝐴 <s 𝐵 ∧ ¬ 𝐵 <s 𝐴))) | |
| 3 | 1, 2 | mpan 703 | 1 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No) → (𝐴 = 𝐵 ↔ (¬ 𝐴 <s 𝐵 ∧ ¬ 𝐵 <s 𝐴))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2144 class class class wbr 5102 Or wor 5557 Nocsur 28003 <s clts 28004 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-ord 6365 df-on 6366 df-suc 6368 df-iota 6494 df-fun 6541 df-fn 6542 df-f 6543 df-fv 6547 df-1o 8480 df-2o 8481 df-no 28006 df-lts 28007 |
| This theorem is used by: lestri3 28118 nocvxmin 28147 om2noseqf1o 28693 |
| Copyright terms: Public domain | W3C validator |