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

Theorem dfpred3g 5660
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 5653 . . 3 (𝑥 = 𝑋 → Pred(𝑅, 𝐴, 𝑥) = Pred(𝑅, 𝐴, 𝑋))
2 breq2 4627 . . . 4 (𝑥 = 𝑋 → (𝑦𝑅𝑥𝑦𝑅𝑋))
32rabbidv 3181 . . 3 (𝑥 = 𝑋 → {𝑦𝐴𝑦𝑅𝑥} = {𝑦𝐴𝑦𝑅𝑋})
41, 3eqeq12d 2636 . 2 (𝑥 = 𝑋 → (Pred(𝑅, 𝐴, 𝑥) = {𝑦𝐴𝑦𝑅𝑥} ↔ Pred(𝑅, 𝐴, 𝑋) = {𝑦𝐴𝑦𝑅𝑋}))
5 vex 3193 . . 3 𝑥 ∈ V
65dfpred3 5659 . 2 Pred(𝑅, 𝐴, 𝑥) = {𝑦𝐴𝑦𝑅𝑥}
74, 6vtoclg 3256 1 (𝑋𝑉 → Pred(𝑅, 𝐴, 𝑋) = {𝑦𝐴𝑦𝑅𝑋})
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1480  wcel 1987  {crab 2912   class class class wbr 4623  Predcpred 5648
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4751  ax-nul 4759  ax-pr 4877
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ral 2913  df-rex 2914  df-rab 2917  df-v 3192  df-sbc 3423  df-dif 3563  df-un 3565  df-in 3567  df-ss 3574  df-nul 3898  df-if 4065  df-sn 4156  df-pr 4158  df-op 4162  df-br 4624  df-opab 4684  df-xp 5090  df-cnv 5092  df-dm 5094  df-rn 5095  df-res 5096  df-ima 5097  df-pred 5649
This theorem is referenced by:  wsuclem  31527  wsuclemOLD  31528
  Copyright terms: Public domain W3C validator