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

Theorem dfse3 6338
Description: Alternate definition of set-like relationships. (Contributed by Scott Fenton, 19-Aug-2024.)
Assertion
Ref Expression
dfse3 (𝑅 Se 𝐴 ↔ ∀𝑥𝐴 Pred(𝑅, 𝐴, 𝑥) ∈ V)
Distinct variable groups:   𝑥,𝐴   𝑥,𝑅

Proof of Theorem dfse3
StepHypRef Expression
1 dfse2 6100 . 2 (𝑅 Se 𝐴 ↔ ∀𝑥𝐴 (𝐴 ∩ (𝑅 “ {𝑥})) ∈ V)
2 df-pred 6301 . . . 4 Pred(𝑅, 𝐴, 𝑥) = (𝐴 ∩ (𝑅 “ {𝑥}))
32eleq1i 2825 . . 3 (Pred(𝑅, 𝐴, 𝑥) ∈ V ↔ (𝐴 ∩ (𝑅 “ {𝑥})) ∈ V)
43ralbii 3094 . 2 (∀𝑥𝐴 Pred(𝑅, 𝐴, 𝑥) ∈ V ↔ ∀𝑥𝐴 (𝐴 ∩ (𝑅 “ {𝑥})) ∈ V)
51, 4bitr4i 278 1 (𝑅 Se 𝐴 ↔ ∀𝑥𝐴 Pred(𝑅, 𝐴, 𝑥) ∈ V)
Colors of variables: wff setvar class
Syntax hints:  wb 205  wcel 2107  wral 3062  Vcvv 3475  cin 3948  {csn 4629   Se wse 5630  ccnv 5676  cima 5680  Predcpred 6300
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-ext 2704  ax-sep 5300  ax-nul 5307  ax-pr 5428
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-sb 2069  df-clab 2711  df-cleq 2725  df-clel 2811  df-ral 3063  df-rex 3072  df-rab 3434  df-v 3477  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-sn 4630  df-pr 4632  df-op 4636  df-br 5150  df-opab 5212  df-se 5633  df-xp 5683  df-cnv 5685  df-dm 5687  df-rn 5688  df-res 5689  df-ima 5690  df-pred 6301
This theorem is referenced by:  sexp2  8132  sexp3  8139  ttrclselem2  9721  ttrclse  9722
  Copyright terms: Public domain W3C validator