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

Theorem brintclab 14967
Description: Two ways to express a binary relation which is the intersection of a class. (Contributed by RP, 4-Apr-2020.)
Assertion
Ref Expression
brintclab (𝐴 {𝑥𝜑}𝐵 ↔ ∀𝑥(𝜑 → ⟨𝐴, 𝐵⟩ ∈ 𝑥))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem brintclab
StepHypRef Expression
1 df-br 5108 . 2 (𝐴 {𝑥𝜑}𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ {𝑥𝜑})
2 opex 5424 . . 3 𝐴, 𝐵⟩ ∈ V
32elintab 4922 . 2 (⟨𝐴, 𝐵⟩ ∈ {𝑥𝜑} ↔ ∀𝑥(𝜑 → ⟨𝐴, 𝐵⟩ ∈ 𝑥))
41, 3bitri 275 1 (𝐴 {𝑥𝜑}𝐵 ↔ ∀𝑥(𝜑 → ⟨𝐴, 𝐵⟩ ∈ 𝑥))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wal 1538  wcel 2109  {cab 2707  cop 4595   cint 4910   class class class wbr 5107
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ral 3045  df-v 3449  df-dif 3917  df-un 3919  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-int 4911  df-br 5108
This theorem is referenced by:  brtrclfv  14968
  Copyright terms: Public domain W3C validator