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

Theorem dfse3 6318
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 6085 . 2 (𝑅 Se 𝐴 ↔ ∀𝑥𝐴 (𝐴 ∩ (𝑅 “ {𝑥})) ∈ V)
2 df-pred 6283 . . . 4 Pred(𝑅, 𝐴, 𝑥) = (𝐴 ∩ (𝑅 “ {𝑥}))
32eleq1i 2852 . . 3 (Pred(𝑅, 𝐴, 𝑥) ∈ V ↔ (𝐴 ∩ (𝑅 “ {𝑥})) ∈ V)
43ralbii 3107 . 2 (∀𝑥𝐴 Pred(𝑅, 𝐴, 𝑥) ∈ V ↔ ∀𝑥𝐴 (𝐴 ∩ (𝑅 “ {𝑥})) ∈ V)
51, 4bitr4i 280 1 (𝑅 Se 𝐴 ↔ ∀𝑥𝐴 Pred(𝑅, 𝐴, 𝑥) ∈ V)
Colors of variables: wff setvar class
Syntax hints:  wb 208  wcel 2141  wral 3075  Vcvv 3453  cin 3901  {csn 4579   Se wse 5594  ccnv 5642  cima 5646  Predcpred 6282
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-ext 2733  ax-sep 5243  ax-pr 5387
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-sb 2090  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-sn 4580  df-pr 4582  df-op 4586  df-br 5098  df-opab 5160  df-se 5597  df-xp 5649  df-cnv 5651  df-dm 5653  df-rn 5654  df-res 5655  df-ima 5656  df-pred 6283
This theorem is referenced by:  sexp2  8120  sexp3  8127  ttrclselem2  9675  ttrclse  9676
  Copyright terms: Public domain W3C validator