| 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 5385 | . . 3 ⊢ {𝐴} ∈ V | |
| 2 | 1 | a1i 11 | . 2 ⊢ (𝐴 ∈ No → {𝐴} ∈ V) |
| 3 | fvexd 6857 | . 2 ⊢ (𝐴 ∈ No → ( R ‘𝐴) ∈ V) | |
| 4 | snssi 4766 | . 2 ⊢ (𝐴 ∈ No → {𝐴} ⊆ No ) | |
| 5 | rightf 27864 | . . . 4 ⊢ R : No ⟶𝒫 No | |
| 6 | 5 | ffvelcdmi 7037 | . . 3 ⊢ (𝐴 ∈ No → ( R ‘𝐴) ∈ 𝒫 No ) |
| 7 | 6 | elpwid 4565 | . 2 ⊢ (𝐴 ∈ No → ( R ‘𝐴) ⊆ No ) |
| 8 | velsn 4598 | . . . 4 ⊢ (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴) | |
| 9 | rightval 27858 | . . . . . . . . . 10 ⊢ ( R ‘𝐴) = {𝑦 ∈ ( O ‘( bday ‘𝐴)) ∣ 𝐴 <s 𝑦} | |
| 10 | 9 | a1i 11 | . . . . . . . . 9 ⊢ (𝐴 ∈ No → ( R ‘𝐴) = {𝑦 ∈ ( O ‘( bday ‘𝐴)) ∣ 𝐴 <s 𝑦}) |
| 11 | 10 | eleq2d 2823 | . . . . . . . 8 ⊢ (𝐴 ∈ No → (𝑦 ∈ ( R ‘𝐴) ↔ 𝑦 ∈ {𝑦 ∈ ( O ‘( bday ‘𝐴)) ∣ 𝐴 <s 𝑦})) |
| 12 | rabid 3422 | . . . . . . . 8 ⊢ (𝑦 ∈ {𝑦 ∈ ( O ‘( bday ‘𝐴)) ∣ 𝐴 <s 𝑦} ↔ (𝑦 ∈ ( O ‘( bday ‘𝐴)) ∧ 𝐴 <s 𝑦)) | |
| 13 | 11, 12 | bitrdi 287 | . . . . . . 7 ⊢ (𝐴 ∈ No → (𝑦 ∈ ( R ‘𝐴) ↔ (𝑦 ∈ ( O ‘( bday ‘𝐴)) ∧ 𝐴 <s 𝑦))) |
| 14 | 13 | simplbda 499 | . . . . . 6 ⊢ ((𝐴 ∈ No ∧ 𝑦 ∈ ( R ‘𝐴)) → 𝐴 <s 𝑦) |
| 15 | breq1 5103 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑥 <s 𝑦 ↔ 𝐴 <s 𝑦)) | |
| 16 | 14, 15 | imbitrrid 246 | . . . . 5 ⊢ (𝑥 = 𝐴 → ((𝐴 ∈ No ∧ 𝑦 ∈ ( R ‘𝐴)) → 𝑥 <s 𝑦)) |
| 17 | 16 | expd 415 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝐴 ∈ No → (𝑦 ∈ ( R ‘𝐴) → 𝑥 <s 𝑦))) |
| 18 | 8, 17 | sylbi 217 | . . 3 ⊢ (𝑥 ∈ {𝐴} → (𝐴 ∈ No → (𝑦 ∈ ( R ‘𝐴) → 𝑥 <s 𝑦))) |
| 19 | 18 | 3imp21 1114 | . 2 ⊢ ((𝐴 ∈ No ∧ 𝑥 ∈ {𝐴} ∧ 𝑦 ∈ ( R ‘𝐴)) → 𝑥 <s 𝑦) |
| 20 | 2, 3, 4, 7, 19 | sltsd 27776 | 1 ⊢ (𝐴 ∈ No → {𝐴} <<s ( R ‘𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 {crab 3401 Vcvv 3442 𝒫 cpw 4556 {csn 4582 class class class wbr 5100 ‘cfv 6500 No csur 27619 <s clts 27620 bday cbday 27621 <<s cslts 27765 O cold 27831 R cright 27834 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-tp 4587 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-1o 8407 df-2o 8408 df-no 27622 df-lts 27623 df-bday 27624 df-slts 27766 df-cuts 27768 df-made 27835 df-old 27836 df-right 27839 |
| This theorem is referenced by: lltr 27870 madebdaylemlrcut 27907 mulsproplem5 28128 mulsproplem6 28129 mulsproplem7 28130 mulsproplem8 28131 mulsuniflem 28157 |
| Copyright terms: Public domain | W3C validator |