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

Theorem dfpred3g 6300
Description: An alternate definition of predecessor class when 𝑋 is a set. (Contributed by Scott Fenton, 13-Jun-2018.)
Assertion
Ref Expression
dfpred3g (𝑋𝑉 → Pred(𝑅, 𝐴, 𝑋) = {𝑦𝐴𝑦𝑅𝑋})
Distinct variable groups:   𝑦,𝑅   𝑦,𝐴   𝑦,𝑋
Allowed substitution hint:   𝑉(𝑦)

Proof of Theorem dfpred3g
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 predeq3 6292 . . 3 (𝑥 = 𝑋 → Pred(𝑅, 𝐴, 𝑥) = Pred(𝑅, 𝐴, 𝑋))
2 breq2 5104 . . . 4 (𝑥 = 𝑋 → (𝑦𝑅𝑥𝑦𝑅𝑋))
32rabbidv 3421 . . 3 (𝑥 = 𝑋 → {𝑦𝐴𝑦𝑅𝑥} = {𝑦𝐴𝑦𝑅𝑋})
41, 3eqeq12d 2778 . 2 (𝑥 = 𝑋 → (Pred(𝑅, 𝐴, 𝑥) = {𝑦𝐴𝑦𝑅𝑥} ↔ Pred(𝑅, 𝐴, 𝑋) = {𝑦𝐴𝑦𝑅𝑋}))
5 vex 3458 . . 3 𝑥 ∈ V
65dfpred3 6299 . 2 Pred(𝑅, 𝐴, 𝑥) = {𝑦𝐴𝑦𝑅𝑥}
74, 6vtoclg 3522 1 (𝑋𝑉 → Pred(𝑅, 𝐴, 𝑋) = {𝑦𝐴𝑦𝑅𝑋})
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1560  wcel 2142  {crab 3414   class class class wbr 5100  Predcpred 6287
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-ext 2734  ax-sep 5246  ax-pr 5390
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-sb 2091  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3077  df-rex 3087  df-rab 3415  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4481  df-sn 4583  df-pr 4585  df-op 4589  df-br 5101  df-opab 5163  df-xp 5653  df-cnv 5655  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-pred 6288
This theorem is referenced by:  lrrecpred  28037  fnrelpredd  35387  wsuclem  36173  dfpred4  38978
  Copyright terms: Public domain W3C validator