| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sltsright | Structured version Visualization version GIF version | ||
| Description: A surreal is less than its right options. Theorem 0(i) of [Conway] p. 16. (Contributed by Scott Fenton, 7-Aug-2024.) |
| Ref | Expression |
|---|---|
| sltsright | ⊢ (𝐴 ∈ No → {𝐴} <<s ( R ‘𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | snex 5410 | . . 3 ⊢ {𝐴} ∈ V | |
| 2 | 1 | a1i 11 | . 2 ⊢ (𝐴 ∈ No → {𝐴} ∈ V) |
| 3 | fvexd 6896 | . 2 ⊢ (𝐴 ∈ No → ( R ‘𝐴) ∈ V) | |
| 4 | snssi 4751 | . 2 ⊢ (𝐴 ∈ No → {𝐴} ⊆ No ) | |
| 5 | rightf 28049 | . . . 4 ⊢ R : No ⟶𝒫 No | |
| 6 | 5 | ffvelcdmi 7078 | . . 3 ⊢ (𝐴 ∈ No → ( R ‘𝐴) ∈ 𝒫 No ) |
| 7 | 6 | elpwid 4571 | . 2 ⊢ (𝐴 ∈ No → ( R ‘𝐴) ⊆ No ) |
| 8 | velsn 4605 | . . . 4 ⊢ (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴) | |
| 9 | rightval 28043 | . . . . . . . . . 10 ⊢ ( R ‘𝐴) = {𝑦 ∈ ( O ‘( bday ‘𝐴)) ∣ 𝐴 <s 𝑦} | |
| 10 | 9 | a1i 11 | . . . . . . . . 9 ⊢ (𝐴 ∈ No → ( R ‘𝐴) = {𝑦 ∈ ( O ‘( bday ‘𝐴)) ∣ 𝐴 <s 𝑦}) |
| 11 | 10 | eleq2d 2849 | . . . . . . . 8 ⊢ (𝐴 ∈ No → (𝑦 ∈ ( R ‘𝐴) ↔ 𝑦 ∈ {𝑦 ∈ ( O ‘( bday ‘𝐴)) ∣ 𝐴 <s 𝑦})) |
| 12 | rabid 3437 | . . . . . . . 8 ⊢ (𝑦 ∈ {𝑦 ∈ ( O ‘( bday ‘𝐴)) ∣ 𝐴 <s 𝑦} ↔ (𝑦 ∈ ( O ‘( bday ‘𝐴)) ∧ 𝐴 <s 𝑦)) | |
| 13 | 11, 12 | bitrdi 290 | . . . . . . 7 ⊢ (𝐴 ∈ No → (𝑦 ∈ ( R ‘𝐴) ↔ (𝑦 ∈ ( O ‘( bday ‘𝐴)) ∧ 𝐴 <s 𝑦))) |
| 14 | 13 | simplbda 504 | . . . . . 6 ⊢ ((𝐴 ∈ No ∧ 𝑦 ∈ ( R ‘𝐴)) → 𝐴 <s 𝑦) |
| 15 | breq1 5112 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑥 <s 𝑦 ↔ 𝐴 <s 𝑦)) | |
| 16 | 14, 15 | imbitrrid 249 | . . . . 5 ⊢ (𝑥 = 𝐴 → ((𝐴 ∈ No ∧ 𝑦 ∈ ( R ‘𝐴)) → 𝑥 <s 𝑦)) |
| 17 | 16 | expd 420 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝐴 ∈ No → (𝑦 ∈ ( R ‘𝐴) → 𝑥 <s 𝑦))) |
| 18 | 8, 17 | sylbi 220 | . . 3 ⊢ (𝑥 ∈ {𝐴} → (𝐴 ∈ No → (𝑦 ∈ ( R ‘𝐴) → 𝑥 <s 𝑦))) |
| 19 | 18 | 3imp21 1131 | . 2 ⊢ ((𝐴 ∈ No ∧ 𝑥 ∈ {𝐴} ∧ 𝑦 ∈ ( R ‘𝐴)) → 𝑥 <s 𝑦) |
| 20 | 2, 3, 4, 7, 19 | sltsd 27961 | 1 ⊢ (𝐴 ∈ No → {𝐴} <<s ( R ‘𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 {crab 3416 Vcvv 3455 𝒫 cpw 4562 {csn 4589 class class class wbr 5109 ‘cfv 6536 No csur 27804 <s clts 27805 bday cbday 27806 <<s cslts 27950 O cold 28016 R cright 28019 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-tp 4594 df-op 4596 df-uni 4873 df-int 4913 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-1o 8449 df-2o 8450 df-no 27807 df-lts 27808 df-bday 27809 df-slts 27951 df-cuts 27953 df-made 28020 df-old 28021 df-right 28024 |
| This theorem is referenced by: lltr 28055 madebdaylemlrcut 28092 mulsproplem5 28313 mulsproplem6 28314 mulsproplem7 28315 mulsproplem8 28316 mulsuniflem 28342 |
| Copyright terms: Public domain | W3C validator |