| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > right1s | Structured version Visualization version GIF version | ||
| Description: The right set of 1s is empty . (Contributed by Scott Fenton, 4-Feb-2025.) |
| Ref | Expression |
|---|---|
| right1s | ⊢ ( R ‘ 1s ) = ∅ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rightval 27856 | . 2 ⊢ ( R ‘ 1s ) = {𝑥 ∈ ( O ‘( bday ‘ 1s )) ∣ 1s <s 𝑥} | |
| 2 | bday1 27820 | . . . . . 6 ⊢ ( bday ‘ 1s ) = 1o | |
| 3 | 2 | fveq2i 6837 | . . . . 5 ⊢ ( O ‘( bday ‘ 1s )) = ( O ‘1o) |
| 4 | old1 27871 | . . . . 5 ⊢ ( O ‘1o) = { 0s } | |
| 5 | 3, 4 | eqtri 2760 | . . . 4 ⊢ ( O ‘( bday ‘ 1s )) = { 0s } |
| 6 | 5 | rabeqi 3403 | . . 3 ⊢ {𝑥 ∈ ( O ‘( bday ‘ 1s )) ∣ 1s <s 𝑥} = {𝑥 ∈ { 0s } ∣ 1s <s 𝑥} |
| 7 | breq2 5090 | . . . 4 ⊢ (𝑥 = 0s → ( 1s <s 𝑥 ↔ 1s <s 0s )) | |
| 8 | 7 | rabsnif 4668 | . . 3 ⊢ {𝑥 ∈ { 0s } ∣ 1s <s 𝑥} = if( 1s <s 0s , { 0s }, ∅) |
| 9 | 6, 8 | eqtri 2760 | . 2 ⊢ {𝑥 ∈ ( O ‘( bday ‘ 1s )) ∣ 1s <s 𝑥} = if( 1s <s 0s , { 0s }, ∅) |
| 10 | 0lt1s 27818 | . . . 4 ⊢ 0s <s 1s | |
| 11 | 0no 27815 | . . . . 5 ⊢ 0s ∈ No | |
| 12 | 1no 27816 | . . . . 5 ⊢ 1s ∈ No | |
| 13 | ltsasym 27726 | . . . . 5 ⊢ (( 0s ∈ No ∧ 1s ∈ No ) → ( 0s <s 1s → ¬ 1s <s 0s )) | |
| 14 | 11, 12, 13 | mp2an 693 | . . . 4 ⊢ ( 0s <s 1s → ¬ 1s <s 0s ) |
| 15 | 10, 14 | ax-mp 5 | . . 3 ⊢ ¬ 1s <s 0s |
| 16 | 15 | iffalsei 4477 | . 2 ⊢ if( 1s <s 0s , { 0s }, ∅) = ∅ |
| 17 | 1, 9, 16 | 3eqtri 2764 | 1 ⊢ ( R ‘ 1s ) = ∅ |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1542 ∈ wcel 2114 {crab 3390 ∅c0 4274 ifcif 4467 {csn 4568 class class class wbr 5086 ‘cfv 6492 1oc1o 8391 No csur 27617 <s clts 27618 bday cbday 27619 0s c0s 27811 1s c1s 27812 O cold 27829 R cright 27832 |
| 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 5212 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 |
| 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 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-tp 4573 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-2nd 7936 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-1o 8398 df-2o 8399 df-no 27620 df-lts 27621 df-bday 27622 df-les 27723 df-slts 27764 df-cuts 27766 df-0s 27813 df-1s 27814 df-made 27833 df-old 27834 df-right 27837 |
| This theorem is referenced by: neg1s 28033 mulsrid 28119 1ons 28263 1reno 28503 |
| Copyright terms: Public domain | W3C validator |