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

Theorem lrrecpred 28336
Description: Finally, we calculate the value of the predecessor class over 𝑅. (Contributed by Scott Fenton, 19-Aug-2024.)
Hypothesis
Ref Expression
lrrec.1 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ ((L‘𝑦) ∪ (R‘𝑦))}
Assertion
Ref Expression
lrrecpred (𝐴 ∈ No → Pred(𝑅, No, 𝐴) = ((L‘𝐴) ∪ (R‘𝐴)))
Distinct variable group:   𝑥,𝐴,𝑦
Allowed substitution hints:   𝑅(𝑥, 𝑦)

Proof of Theorem lrrecpred
Dummy variable 𝑏 is distinct from all other variables.
StepHypRef Expression
1 dfpred3g 6316 . 2 (𝐴 ∈ No → Pred(𝑅, No, 𝐴) = {𝑏 ∈ No ∣ 𝑏𝑅𝐴})
2 lrrec.1 . . . . . 6 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ ((L‘𝑦) ∪ (R‘𝑦))}
32lrrecval 28331 . . . . 5 ((𝑏 ∈ No ∧ 𝐴 ∈ No) → (𝑏𝑅𝐴 ↔ 𝑏 ∈ ((L‘𝐴) ∪ (R‘𝐴))))
43ancoms 464 . . . 4 ((𝐴 ∈ No ∧ 𝑏 ∈ No) → (𝑏𝑅𝐴 ↔ 𝑏 ∈ ((L‘𝐴) ∪ (R‘𝐴))))
54rabbidva 3418 . . 3 (𝐴 ∈ No → {𝑏 ∈ No ∣ 𝑏𝑅𝐴} = {𝑏 ∈ No ∣ 𝑏 ∈ ((L‘𝐴) ∪ (R‘𝐴))})
6 dfrab2 4265 . . . 4 {𝑏 ∈ No ∣ 𝑏 ∈ ((L‘𝐴) ∪ (R‘𝐴))} = ({𝑏 ∣ 𝑏 ∈ ((L‘𝐴) ∪ (R‘𝐴))} ∩ No)
7 abid2 2897 . . . . 5 {𝑏 ∣ 𝑏 ∈ ((L‘𝐴) ∪ (R‘𝐴))} = ((L‘𝐴) ∪ (R‘𝐴))
87ineq1i 4113 . . . 4 ({𝑏 ∣ 𝑏 ∈ ((L‘𝐴) ∪ (R‘𝐴))} ∩ No) = (((L‘𝐴) ∪ (R‘𝐴)) ∩ No)
96, 8eqtri 2783 . . 3 {𝑏 ∈ No ∣ 𝑏 ∈ ((L‘𝐴) ∪ (R‘𝐴))} = (((L‘𝐴) ∪ (R‘𝐴)) ∩ No)
105, 9eqtrdi 2811 . 2 (𝐴 ∈ No → {𝑏 ∈ No ∣ 𝑏𝑅𝐴} = (((L‘𝐴) ∪ (R‘𝐴)) ∩ No))
11 leftssno 28265 . . . . 5 (L‘𝐴) ⊆ No
1211a1i 11 . . . 4 (𝐴 ∈ No → (L‘𝐴) ⊆ No)
13 rightssno 28266 . . . . 5 (R‘𝐴) ⊆ No
1413a1i 11 . . . 4 (𝐴 ∈ No → (R‘𝐴) ⊆ No)
1512, 14unssd 4190 . . 3 (𝐴 ∈ No → ((L‘𝐴) ∪ (R‘𝐴)) ⊆ No)
16 dfss2 4094 . . 3 (((L‘𝐴) ∪ (R‘𝐴)) ⊆ No ↔ (((L‘𝐴) ∪ (R‘𝐴)) ∩ No) = ((L‘𝐴) ∪ (R‘𝐴)))
1715, 16sylib 221 . 2 (𝐴 ∈ No → (((L‘𝐴) ∪ (R‘𝐴)) ∩ No) = ((L‘𝐴) ∪ (R‘𝐴)))
181, 10, 173eqtrd 2799 1 (𝐴 ∈ No → Pred(𝑅, No, 𝐴) = ((L‘𝐴) ∪ (R‘𝐴)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1569   ∈ wcel 2144  {cab 2738  {crab 3412   ⊆ wss 3895   ∩ cin 4089   ∪ cun 4149   class class class wbr 5102  {copab 5166  Predcpred 6303  ‘cfv 6539  Nocsur 28003  Lcleft 28217  Rcright 28218
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7752
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4835  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-suc 6368  df-iota 6494  df-fun 6541  df-fn 6542  df-f 6543  df-f1 6544  df-fo 6545  df-f1o 6546  df-fv 6547  df-riota 7378  df-ov 7424  df-oprab 7425  df-mpo 7426  df-2nd 8003  df-frecs 8303  df-wrecs 8334  df-recs 8383  df-1o 8480  df-2o 8481  df-no 28006  df-lts 28007  df-bday 28008  df-slts 28150  df-cuts 28152  df-made 28219  df-old 28220  df-left 28222  df-right 28223
This theorem is used by:  noinds  28337  norecov  28339  noxpordpred  28345  no2indlesm  28346  no3inds  28350
  Copyright terms: Public domain W3C validator