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

Theorem brintclab 15007
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 5098 . 2 (𝐴 {𝑥𝜑}𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ {𝑥𝜑})
2 opex 5428 . . 3 𝐴, 𝐵⟩ ∈ V
32elintab 4914 . 2 (⟨𝐴, 𝐵⟩ ∈ {𝑥𝜑} ↔ ∀𝑥(𝜑 → ⟨𝐴, 𝐵⟩ ∈ 𝑥))
41, 3bitri 277 1 (𝐴 {𝑥𝜑}𝐵 ↔ ∀𝑥(𝜑 → ⟨𝐴, 𝐵⟩ ∈ 𝑥))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wal 1557  wcel 2141  {cab 2739  cop 4585   cint 4902   class class class wbr 5097
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-10 2174  ax-11 2190  ax-12 2211  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-ex 1799  df-nf 1803  df-sb 2090  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3076  df-rab 3414  df-v 3455  df-un 3907  df-in 3909  df-ss 3919  df-sn 4580  df-pr 4582  df-op 4586  df-int 4903  df-br 5098
This theorem is referenced by:  brtrclfv  15008
  Copyright terms: Public domain W3C validator