| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lenlts | Structured version Visualization version GIF version | ||
| Description: Surreal less-than or equal in terms of less-than. (Contributed by Scott Fenton, 8-Dec-2021.) |
| Ref | Expression |
|---|---|
| lenlts | ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) → (𝐴 ≤s 𝐵 ↔ ¬ 𝐵 <s 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-les 27734 | . . . 4 ⊢ ≤s = (( No × No ) ∖ ◡ <s ) | |
| 2 | 1 | breqi 5085 | . . 3 ⊢ (𝐴 ≤s 𝐵 ↔ 𝐴(( No × No ) ∖ ◡ <s )𝐵) |
| 3 | brdif 5132 | . . 3 ⊢ (𝐴(( No × No ) ∖ ◡ <s )𝐵 ↔ (𝐴( No × No )𝐵 ∧ ¬ 𝐴◡ <s 𝐵)) | |
| 4 | brxp 5674 | . . . 4 ⊢ (𝐴( No × No )𝐵 ↔ (𝐴 ∈ No ∧ 𝐵 ∈ No )) | |
| 5 | 4 | anbi1i 630 | . . 3 ⊢ ((𝐴( No × No )𝐵 ∧ ¬ 𝐴◡ <s 𝐵) ↔ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ ¬ 𝐴◡ <s 𝐵)) |
| 6 | 2, 3, 5 | 3bitri 298 | . 2 ⊢ (𝐴 ≤s 𝐵 ↔ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ ¬ 𝐴◡ <s 𝐵)) |
| 7 | ibar 533 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) → (¬ 𝐴◡ <s 𝐵 ↔ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ ¬ 𝐴◡ <s 𝐵))) | |
| 8 | brcnvg 5828 | . . . 4 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) → (𝐴◡ <s 𝐵 ↔ 𝐵 <s 𝐴)) | |
| 9 | 8 | notbid 319 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) → (¬ 𝐴◡ <s 𝐵 ↔ ¬ 𝐵 <s 𝐴)) |
| 10 | 7, 9 | bitr3d 282 | . 2 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) → (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ ¬ 𝐴◡ <s 𝐵) ↔ ¬ 𝐵 <s 𝐴)) |
| 11 | 6, 10 | bitrid 284 | 1 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) → (𝐴 ≤s 𝐵 ↔ ¬ 𝐵 <s 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 207 ∧ wa 396 ∈ wcel 2119 ∖ cdif 3887 class class class wbr 5079 × cxp 5623 ◡ccnv 5624 No csur 27628 <s clts 27629 ≤s cles 27733 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2712 ax-sep 5225 ax-pr 5369 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2719 df-cleq 2732 df-clel 2815 df-ral 3055 df-rex 3065 df-rab 3393 df-v 3434 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4269 df-if 4462 df-sn 4563 df-pr 4565 df-op 4569 df-br 5080 df-opab 5142 df-xp 5631 df-cnv 5633 df-les 27734 |
| This theorem is referenced by: ltnles 27742 lesloe 27743 lestri3 27744 lesnltd 27745 ltlestr 27749 leltstr 27750 lestr 27751 lesid 27756 lestric 27757 ltlesd 27762 ltsrec 27818 ltslpss 27925 cofcutr 27941 lenegs 28063 lesubsubsbd 28103 lesubsubs2bd 28104 lesubsubs3bd 28105 lesubaddsd 28110 lemuls2d 28191 lemuls1d 28192 ltonold 28278 oncutlt 28281 onnolt 28283 onles 28285 om2noseqlt2 28317 n0fincut 28372 bdaypw2n0bndlem 28480 bdaypw2bnd 28482 bdayfinbndlem1 28484 z12bdaylem1 28487 |
| Copyright terms: Public domain | W3C validator |