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

Theorem predres 6341
Description: Predecessor class is unaffected by restriction to the base class. (Contributed by Scott Fenton, 25-Nov-2024.)
Assertion
Ref Expression
predres Pred(𝑅, 𝐴, 𝑋) = Pred((𝑅 ↾ 𝐴), 𝐴, 𝑋)

Proof of Theorem predres
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 ssrab2 4028 . . . . . 6 {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑋} ⊆ 𝐴
2 sseqin2 4169 . . . . . 6 ({𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑋} ⊆ 𝐴 ↔ (𝐴 ∩ {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑋}) = {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑋})
31, 2mpbi 233 . . . . 5 (𝐴 ∩ {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑋}) = {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑋}
4 dfrab2 4266 . . . . 5 {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑋} = ({𝑦 ∣ 𝑦𝑅𝑋} ∩ 𝐴)
53, 4eqtr2i 2785 . . . 4 ({𝑦 ∣ 𝑦𝑅𝑋} ∩ 𝐴) = (𝐴 ∩ {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑋})
6 iniseg 6095 . . . . . 6 (𝑋 ∈ V → (◡𝑅 “ {𝑋}) = {𝑦 ∣ 𝑦𝑅𝑋})
76ineq2d 4166 . . . . 5 (𝑋 ∈ V → (𝐴 ∩ (◡𝑅 “ {𝑋})) = (𝐴 ∩ {𝑦 ∣ 𝑦𝑅𝑋}))
8 incom 4155 . . . . 5 (𝐴 ∩ {𝑦 ∣ 𝑦𝑅𝑋}) = ({𝑦 ∣ 𝑦𝑅𝑋} ∩ 𝐴)
97, 8eqtrdi 2812 . . . 4 (𝑋 ∈ V → (𝐴 ∩ (◡𝑅 “ {𝑋})) = ({𝑦 ∣ 𝑦𝑅𝑋} ∩ 𝐴))
10 iniseg 6095 . . . . . 6 (𝑋 ∈ V → (◡(𝑅 ↾ 𝐴) “ {𝑋}) = {𝑦 ∣ 𝑦(𝑅 ↾ 𝐴)𝑋})
11 brres 5977 . . . . . . . 8 (𝑋 ∈ V → (𝑦(𝑅 ↾ 𝐴)𝑋 ↔ (𝑦 ∈ 𝐴 ∧ 𝑦𝑅𝑋)))
1211abbidv 2827 . . . . . . 7 (𝑋 ∈ V → {𝑦 ∣ 𝑦(𝑅 ↾ 𝐴)𝑋} = {𝑦 ∣ (𝑦 ∈ 𝐴 ∧ 𝑦𝑅𝑋)})
13 df-rab 3414 . . . . . . 7 {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑋} = {𝑦 ∣ (𝑦 ∈ 𝐴 ∧ 𝑦𝑅𝑋)}
1412, 13eqtr4di 2814 . . . . . 6 (𝑋 ∈ V → {𝑦 ∣ 𝑦(𝑅 ↾ 𝐴)𝑋} = {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑋})
1510, 14eqtrd 2796 . . . . 5 (𝑋 ∈ V → (◡(𝑅 ↾ 𝐴) “ {𝑋}) = {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑋})
1615ineq2d 4166 . . . 4 (𝑋 ∈ V → (𝐴 ∩ (◡(𝑅 ↾ 𝐴) “ {𝑋})) = (𝐴 ∩ {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑋}))
175, 9, 163eqtr4a 2822 . . 3 (𝑋 ∈ V → (𝐴 ∩ (◡𝑅 “ {𝑋})) = (𝐴 ∩ (◡(𝑅 ↾ 𝐴) “ {𝑋})))
18 df-pred 6303 . . 3 Pred(𝑅, 𝐴, 𝑋) = (𝐴 ∩ (◡𝑅 “ {𝑋}))
19 df-pred 6303 . . 3 Pred((𝑅 ↾ 𝐴), 𝐴, 𝑋) = (𝐴 ∩ (◡(𝑅 ↾ 𝐴) “ {𝑋}))
2017, 18, 193eqtr4g 2821 . 2 (𝑋 ∈ V → Pred(𝑅, 𝐴, 𝑋) = Pred((𝑅 ↾ 𝐴), 𝐴, 𝑋))
21 predprc 6340 . . 3 (¬ 𝑋 ∈ V → Pred(𝑅, 𝐴, 𝑋) = ∅)
22 predprc 6340 . . 3 (¬ 𝑋 ∈ V → Pred((𝑅 ↾ 𝐴), 𝐴, 𝑋) = ∅)
2321, 22eqtr4d 2799 . 2 (¬ 𝑋 ∈ V → Pred(𝑅, 𝐴, 𝑋) = Pred((𝑅 ↾ 𝐴), 𝐴, 𝑋))
2420, 23pm2.61i 184 1 Pred(𝑅, 𝐴, 𝑋) = Pred((𝑅 ↾ 𝐴), 𝐴, 𝑋)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {cab 2739  {crab 3413  Vcvv 3451   ∩ cin 3898   ⊆ wss 3899  ∅c0 4279  {csn 4584   class class class wbr 5103  ◡ccnv 5650   ↾ cres 5653   “ cima 5654  Predcpred 6302
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-ext 2733  ax-sep 5249  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-xp 5657  df-cnv 5659  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6303
This theorem is used by:  frmin  9746  frrlem16  9755  frr1  9756
  Copyright terms: Public domain W3C validator