| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ltlesnd | Structured version Visualization version GIF version | ||
| Description: Surreal less-than in terms of less-than or equal. (Contributed by Scott Fenton, 15-Apr-2025.) |
| Ref | Expression |
|---|---|
| ltlesn.1 | ⊢ (𝜑 → 𝐴 ∈ No ) |
| ltlesn.2 | ⊢ (𝜑 → 𝐵 ∈ No ) |
| Ref | Expression |
|---|---|
| ltlesnd | ⊢ (𝜑 → (𝐴 <s 𝐵 ↔ (𝐴 ≤s 𝐵 ∧ 𝐵 ≠ 𝐴))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ltlesn.1 | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ No ) | |
| 2 | 1 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 <s 𝐵) → 𝐴 ∈ No ) |
| 3 | ltlesn.2 | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ No ) | |
| 4 | 3 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 <s 𝐵) → 𝐵 ∈ No ) |
| 5 | simpr 490 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 <s 𝐵) → 𝐴 <s 𝐵) | |
| 6 | 2, 4, 5 | ltlesd 28017 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 <s 𝐵) → 𝐴 ≤s 𝐵) |
| 7 | 6 | ex 418 | . . 3 ⊢ (𝜑 → (𝐴 <s 𝐵 → 𝐴 ≤s 𝐵)) |
| 8 | ltsne 28018 | . . . . 5 ⊢ ((𝐴 ∈ No ∧ 𝐴 <s 𝐵) → 𝐵 ≠ 𝐴) | |
| 9 | 1, 8 | sylan 592 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 <s 𝐵) → 𝐵 ≠ 𝐴) |
| 10 | 9 | ex 418 | . . 3 ⊢ (𝜑 → (𝐴 <s 𝐵 → 𝐵 ≠ 𝐴)) |
| 11 | 7, 10 | jcad 522 | . 2 ⊢ (𝜑 → (𝐴 <s 𝐵 → (𝐴 ≤s 𝐵 ∧ 𝐵 ≠ 𝐴))) |
| 12 | lesloe 27998 | . . . . 5 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) → (𝐴 ≤s 𝐵 ↔ (𝐴 <s 𝐵 ∨ 𝐴 = 𝐵))) | |
| 13 | 1, 3, 12 | syl2anc 596 | . . . 4 ⊢ (𝜑 → (𝐴 ≤s 𝐵 ↔ (𝐴 <s 𝐵 ∨ 𝐴 = 𝐵))) |
| 14 | eqneqall 2968 | . . . . . 6 ⊢ (𝐵 = 𝐴 → (𝐵 ≠ 𝐴 → 𝐴 <s 𝐵)) | |
| 15 | 14 | eqcoms 2770 | . . . . 5 ⊢ (𝐴 = 𝐵 → (𝐵 ≠ 𝐴 → 𝐴 <s 𝐵)) |
| 16 | 15 | jao1i 872 | . . . 4 ⊢ ((𝐴 <s 𝐵 ∨ 𝐴 = 𝐵) → (𝐵 ≠ 𝐴 → 𝐴 <s 𝐵)) |
| 17 | 13, 16 | biimtrdi 256 | . . 3 ⊢ (𝜑 → (𝐴 ≤s 𝐵 → (𝐵 ≠ 𝐴 → 𝐴 <s 𝐵))) |
| 18 | 17 | impd 416 | . 2 ⊢ (𝜑 → ((𝐴 ≤s 𝐵 ∧ 𝐵 ≠ 𝐴) → 𝐴 <s 𝐵)) |
| 19 | 11, 18 | impbid 215 | 1 ⊢ (𝜑 → (𝐴 <s 𝐵 ↔ (𝐴 ≤s 𝐵 ∧ 𝐵 ≠ 𝐴))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2145 ≠ wne 2957 class class class wbr 5107 No csur 27884 <s clts 27885 ≤s cles 27988 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pr 5402 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-ord 6364 df-on 6365 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-fv 6545 df-1o 8459 df-2o 8460 df-no 27887 df-lts 27888 df-les 27989 |
| This theorem is used by: nnsgt0 28612 n0subs2 28637 |
| Copyright terms: Public domain | W3C validator |