| 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 27846 | . 2 ⊢ ( R ‘ 1s ) = {𝑥 ∈ ( O ‘( bday ‘ 1s )) ∣ 1s <s 𝑥} | |
| 2 | bday1 27810 | . . . . . 6 ⊢ ( bday ‘ 1s ) = 1o | |
| 3 | 2 | fveq2i 6837 | . . . . 5 ⊢ ( O ‘( bday ‘ 1s )) = ( O ‘1o) |
| 4 | old1 27861 | . . . . 5 ⊢ ( O ‘1o) = { 0s } | |
| 5 | 3, 4 | eqtri 2759 | . . . 4 ⊢ ( O ‘( bday ‘ 1s )) = { 0s } |
| 6 | 5 | rabeqi 3412 | . . 3 ⊢ {𝑥 ∈ ( O ‘( bday ‘ 1s )) ∣ 1s <s 𝑥} = {𝑥 ∈ { 0s } ∣ 1s <s 𝑥} |
| 7 | breq2 5102 | . . . 4 ⊢ (𝑥 = 0s → ( 1s <s 𝑥 ↔ 1s <s 0s )) | |
| 8 | 7 | rabsnif 4680 | . . 3 ⊢ {𝑥 ∈ { 0s } ∣ 1s <s 𝑥} = if( 1s <s 0s , { 0s }, ∅) |
| 9 | 6, 8 | eqtri 2759 | . 2 ⊢ {𝑥 ∈ ( O ‘( bday ‘ 1s )) ∣ 1s <s 𝑥} = if( 1s <s 0s , { 0s }, ∅) |
| 10 | 0lt1s 27808 | . . . 4 ⊢ 0s <s 1s | |
| 11 | 0no 27805 | . . . . 5 ⊢ 0s ∈ No | |
| 12 | 1no 27806 | . . . . 5 ⊢ 1s ∈ No | |
| 13 | ltsasym 27716 | . . . . 5 ⊢ (( 0s ∈ No ∧ 1s ∈ No ) → ( 0s <s 1s → ¬ 1s <s 0s )) | |
| 14 | 11, 12, 13 | mp2an 692 | . . . 4 ⊢ ( 0s <s 1s → ¬ 1s <s 0s ) |
| 15 | 10, 14 | ax-mp 5 | . . 3 ⊢ ¬ 1s <s 0s |
| 16 | 15 | iffalsei 4489 | . 2 ⊢ if( 1s <s 0s , { 0s }, ∅) = ∅ |
| 17 | 1, 9, 16 | 3eqtri 2763 | 1 ⊢ ( R ‘ 1s ) = ∅ |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1541 ∈ wcel 2113 {crab 3399 ∅c0 4285 ifcif 4479 {csn 4580 class class class wbr 5098 ‘cfv 6492 1oc1o 8390 No csur 27607 <s clts 27608 bday cbday 27609 0s c0s 27801 1s c1s 27802 O cold 27819 R cright 27822 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-tp 4585 df-op 4587 df-uni 4864 df-int 4903 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 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 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-1o 8397 df-2o 8398 df-no 27610 df-lts 27611 df-bday 27612 df-les 27713 df-slts 27754 df-cuts 27756 df-0s 27803 df-1s 27804 df-made 27823 df-old 27824 df-right 27827 |
| This theorem is referenced by: neg1s 28023 mulsrid 28109 1ons 28253 1reno 28493 |
| Copyright terms: Public domain | W3C validator |