![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > rightval | Structured version Visualization version GIF version |
Description: The value of the right options function. (Contributed by Scott Fenton, 9-Oct-2024.) |
Ref | Expression |
---|---|
rightval | ⊢ ( R ‘𝐴) = {𝑥 ∈ ( O ‘( bday ‘𝐴)) ∣ 𝐴 <s 𝑥} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 2fveq3 6897 | . . . 4 ⊢ (𝑦 = 𝐴 → ( O ‘( bday ‘𝑦)) = ( O ‘( bday ‘𝐴))) | |
2 | breq1 5152 | . . . 4 ⊢ (𝑦 = 𝐴 → (𝑦 <s 𝑥 ↔ 𝐴 <s 𝑥)) | |
3 | 1, 2 | rabeqbidv 3450 | . . 3 ⊢ (𝑦 = 𝐴 → {𝑥 ∈ ( O ‘( bday ‘𝑦)) ∣ 𝑦 <s 𝑥} = {𝑥 ∈ ( O ‘( bday ‘𝐴)) ∣ 𝐴 <s 𝑥}) |
4 | df-right 27346 | . . 3 ⊢ R = (𝑦 ∈ No ↦ {𝑥 ∈ ( O ‘( bday ‘𝑦)) ∣ 𝑦 <s 𝑥}) | |
5 | fvex 6905 | . . . 4 ⊢ ( O ‘( bday ‘𝐴)) ∈ V | |
6 | 5 | rabex 5333 | . . 3 ⊢ {𝑥 ∈ ( O ‘( bday ‘𝐴)) ∣ 𝐴 <s 𝑥} ∈ V |
7 | 3, 4, 6 | fvmpt 6999 | . 2 ⊢ (𝐴 ∈ No → ( R ‘𝐴) = {𝑥 ∈ ( O ‘( bday ‘𝐴)) ∣ 𝐴 <s 𝑥}) |
8 | 4 | fvmptndm 7029 | . . 3 ⊢ (¬ 𝐴 ∈ No → ( R ‘𝐴) = ∅) |
9 | bdaydm 27276 | . . . . . . . . 9 ⊢ dom bday = No | |
10 | 9 | eleq2i 2826 | . . . . . . . 8 ⊢ (𝐴 ∈ dom bday ↔ 𝐴 ∈ No ) |
11 | ndmfv 6927 | . . . . . . . 8 ⊢ (¬ 𝐴 ∈ dom bday → ( bday ‘𝐴) = ∅) | |
12 | 10, 11 | sylnbir 331 | . . . . . . 7 ⊢ (¬ 𝐴 ∈ No → ( bday ‘𝐴) = ∅) |
13 | 12 | fveq2d 6896 | . . . . . 6 ⊢ (¬ 𝐴 ∈ No → ( O ‘( bday ‘𝐴)) = ( O ‘∅)) |
14 | old0 27354 | . . . . . 6 ⊢ ( O ‘∅) = ∅ | |
15 | 13, 14 | eqtrdi 2789 | . . . . 5 ⊢ (¬ 𝐴 ∈ No → ( O ‘( bday ‘𝐴)) = ∅) |
16 | 15 | rabeqdv 3448 | . . . 4 ⊢ (¬ 𝐴 ∈ No → {𝑥 ∈ ( O ‘( bday ‘𝐴)) ∣ 𝐴 <s 𝑥} = {𝑥 ∈ ∅ ∣ 𝐴 <s 𝑥}) |
17 | rab0 4383 | . . . 4 ⊢ {𝑥 ∈ ∅ ∣ 𝐴 <s 𝑥} = ∅ | |
18 | 16, 17 | eqtrdi 2789 | . . 3 ⊢ (¬ 𝐴 ∈ No → {𝑥 ∈ ( O ‘( bday ‘𝐴)) ∣ 𝐴 <s 𝑥} = ∅) |
19 | 8, 18 | eqtr4d 2776 | . 2 ⊢ (¬ 𝐴 ∈ No → ( R ‘𝐴) = {𝑥 ∈ ( O ‘( bday ‘𝐴)) ∣ 𝐴 <s 𝑥}) |
20 | 7, 19 | pm2.61i 182 | 1 ⊢ ( R ‘𝐴) = {𝑥 ∈ ( O ‘( bday ‘𝐴)) ∣ 𝐴 <s 𝑥} |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 = wceq 1542 ∈ wcel 2107 {crab 3433 ∅c0 4323 class class class wbr 5149 dom cdm 5677 ‘cfv 6544 No csur 27143 <s cslt 27144 bday cbday 27145 O cold 27338 R cright 27341 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pr 5428 ax-un 7725 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-ral 3063 df-rex 3072 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-ov 7412 df-2nd 7976 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-1o 8466 df-no 27146 df-bday 27148 df-made 27342 df-old 27343 df-right 27346 |
This theorem is referenced by: ssltright 27366 rightssold 27374 right1s 27390 lrold 27391 madebdaylemlrcut 27393 0elright 27404 cofcutr 27411 cofcutrtime 27414 addsproplem2 27454 addsproplem5 27457 addsproplem6 27458 sleadd1 27472 negsproplem5 27506 negsproplem6 27507 negsid 27515 mulsproplem12 27583 precsexlem8 27660 precsexlem9 27661 precsexlem11 27663 |
Copyright terms: Public domain | W3C validator |