| 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 28123 | . 2 ⊢ ( R ‘ 1s ) = {𝑥 ∈ ( O ‘( bday ‘ 1s )) ∣ 1s <s 𝑥} | |
| 2 | bday1 28087 | . . . . . 6 ⊢ ( bday ‘ 1s ) = 1o | |
| 3 | 2 | fveq2i 6885 | . . . . 5 ⊢ ( O ‘( bday ‘ 1s )) = ( O ‘1o) |
| 4 | old1 28138 | . . . . 5 ⊢ ( O ‘1o) = { 0s } | |
| 5 | 3, 4 | eqtri 2785 | . . . 4 ⊢ ( O ‘( bday ‘ 1s )) = { 0s } |
| 6 | 5 | rabeqi 3427 | . . 3 ⊢ {𝑥 ∈ ( O ‘( bday ‘ 1s )) ∣ 1s <s 𝑥} = {𝑥 ∈ { 0s } ∣ 1s <s 𝑥} |
| 7 | breq2 5111 | . . . 4 ⊢ (𝑥 = 0s → ( 1s <s 𝑥 ↔ 1s <s 0s )) | |
| 8 | 7 | rabsnif 4687 | . . 3 ⊢ {𝑥 ∈ { 0s } ∣ 1s <s 𝑥} = if( 1s <s 0s , { 0s }, ∅) |
| 9 | 6, 8 | eqtri 2785 | . 2 ⊢ {𝑥 ∈ ( O ‘( bday ‘ 1s )) ∣ 1s <s 𝑥} = if( 1s <s 0s , { 0s }, ∅) |
| 10 | 0lt1s 28085 | . . . 4 ⊢ 0s <s 1s | |
| 11 | 0no 28082 | . . . . 5 ⊢ 0s ∈ No | |
| 12 | 1no 28083 | . . . . 5 ⊢ 1s ∈ No | |
| 13 | ltsasym 27992 | . . . . 5 ⊢ (( 0s ∈ No ∧ 1s ∈ No ) → ( 0s <s 1s → ¬ 1s <s 0s )) | |
| 14 | 11, 12, 13 | mp2an 705 | . . . 4 ⊢ ( 0s <s 1s → ¬ 1s <s 0s ) |
| 15 | 10, 14 | ax-mp 5 | . . 3 ⊢ ¬ 1s <s 0s |
| 16 | 15 | iffalsei 4495 | . 2 ⊢ if( 1s <s 0s , { 0s }, ∅) = ∅ |
| 17 | 1, 9, 16 | 3eqtri 2789 | 1 ⊢ ( R ‘ 1s ) = ∅ |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 = wceq 1570 ∈ wcel 2145 {crab 3414 ∅c0 4282 ifcif 4485 {csn 4587 class class class wbr 5107 ‘cfv 6537 1oc1o 8452 No csur 27884 <s clts 27885 bday cbday 27886 0s c0s 28078 1s c1s 28079 O cold 28096 R cright 28099 |
| 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-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 |
| 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-rmo 3367 df-reu 3368 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-int 4911 df-iun 4956 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-pred 6303 df-ord 6364 df-on 6365 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7374 df-ov 7420 df-oprab 7421 df-mpo 7422 df-2nd 7991 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-1o 8459 df-2o 8460 df-no 27887 df-lts 27888 df-bday 27889 df-les 27989 df-slts 28031 df-cuts 28033 df-0s 28080 df-1s 28081 df-made 28100 df-old 28101 df-right 28104 |
| This theorem is used by: neg1s 28300 mulsrid 28386 1ons 28530 1reno 28770 |
| Copyright terms: Public domain | W3C validator |