MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  leftval Structured version   Visualization version   GIF version

Theorem leftval 28217
Description: The value of the left options function. (Contributed by Scott Fenton, 9-Oct-2024.)
Assertion
Ref Expression
leftval ( L ‘𝐴) = {𝑥 ∈ ( O ‘( bday ‘𝐴)) ∣ 𝑥 <s 𝐴}
Distinct variable group:   𝑥,𝐴

Proof of Theorem leftval
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 2fveq3 6882 . . . 4 (𝑦 = 𝐴 → ( O ‘( bday ‘𝑦)) = ( O ‘( bday ‘𝐴)))
2 breq2 5107 . . . 4 (𝑦 = 𝐴 → (𝑥 <s 𝑦 ↔ 𝑥 <s 𝐴))
31, 2rabeqbidv 3430 . . 3 (𝑦 = 𝐴 → {𝑥 ∈ ( O ‘( bday ‘𝑦)) ∣ 𝑥 <s 𝑦} = {𝑥 ∈ ( O ‘( bday ‘𝐴)) ∣ 𝑥 <s 𝐴})
4 df-left 28198 . . 3 L = (𝑦 ∈ No ↦ {𝑥 ∈ ( O ‘( bday ‘𝑦)) ∣ 𝑥 <s 𝑦})
5 fvex 6890 . . . 4 ( O ‘( bday ‘𝐴)) ∈ V
65rabex 5300 . . 3 {𝑥 ∈ ( O ‘( bday ‘𝐴)) ∣ 𝑥 <s 𝐴} ∈ V
73, 4, 6fvmpt 6985 . 2 (𝐴 ∈ No → ( L ‘𝐴) = {𝑥 ∈ ( O ‘( bday ‘𝐴)) ∣ 𝑥 <s 𝐴})
84fvmptndm 7017 . . 3 (¬ 𝐴 ∈ No → ( L ‘𝐴) = ∅)
9 bdaydm 28117 . . . . . . . . 9 dom bday = No
109eleq2i 2853 . . . . . . . 8 (𝐴 ∈ dom bday ↔ 𝐴 ∈ No )
11 ndmfv 6909 . . . . . . . 8 (¬ 𝐴 ∈ dom bday → ( bday ‘𝐴) = ∅)
1210, 11sylnbir 334 . . . . . . 7 (¬ 𝐴 ∈ No → ( bday ‘𝐴) = ∅)
1312fveq2d 6881 . . . . . 6 (¬ 𝐴 ∈ No → ( O ‘( bday ‘𝐴)) = ( O ‘∅))
14 old0 28207 . . . . . 6 ( O ‘∅) = ∅
1513, 14eqtrdi 2812 . . . . 5 (¬ 𝐴 ∈ No → ( O ‘( bday ‘𝐴)) = ∅)
1615rabeqdv 3428 . . . 4 (¬ 𝐴 ∈ No → {𝑥 ∈ ( O ‘( bday ‘𝐴)) ∣ 𝑥 <s 𝐴} = {𝑥 ∈ ∅ ∣ 𝑥 <s 𝐴})
17 rab0 4335 . . . 4 {𝑥 ∈ ∅ ∣ 𝑥 <s 𝐴} = ∅
1816, 17eqtrdi 2812 . . 3 (¬ 𝐴 ∈ No → {𝑥 ∈ ( O ‘( bday ‘𝐴)) ∣ 𝑥 <s 𝐴} = ∅)
198, 18eqtr4d 2799 . 2 (¬ 𝐴 ∈ No → ( L ‘𝐴) = {𝑥 ∈ ( O ‘( bday ‘𝐴)) ∣ 𝑥 <s 𝐴})
207, 19pm2.61i 184 1 ( L ‘𝐴) = {𝑥 ∈ ( O ‘( bday ‘𝐴)) ∣ 𝑥 <s 𝐴}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   = wceq 1570   ∈ wcel 2145  {crab 3413  ∅c0 4279   class class class wbr 5103  dom cdm 5651  ‘cfv 6531   No csur 27979   <s clts 27980   bday cbday 27981   O cold 28191   L cleft 28193
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 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297  df-ord 6358  df-on 6359  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-2nd 7991  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-1o 8460  df-no 27982  df-bday 27984  df-made 28195  df-old 28196  df-left 28198
This theorem is used by:  elleft  28219  sltsleft  28228  leftssold  28239  left1s  28263  lrold  28265  madebdaylemlrcut  28267  ltslpss  28276  cofcutr  28292  cofcutrtime  28295  addsproplem2  28338
  Copyright terms: Public domain W3C validator