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

Theorem brintclab 15160
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 5103 . 2 (𝐴∩ {𝑥 ∣ 𝜑}𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ ∩ {𝑥 ∣ 𝜑})
2 opex 5431 . . 3 ⟨𝐴, 𝐵⟩ ∈ V
32elintab 4918 . 2 (⟨𝐴, 𝐵⟩ ∈ ∩ {𝑥 ∣ 𝜑} ↔ ∀𝑥(𝜑 → ⟨𝐴, 𝐵⟩ ∈ 𝑥))
41, 3bitri 278 1 (𝐴∩ {𝑥 ∣ 𝜑}𝐵 ↔ ∀𝑥(𝜑 → ⟨𝐴, 𝐵⟩ ∈ 𝑥))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1567   ∈ wcel 2144  {cab 2738  ⟨cop 4834  ∩ cint 4906   class class class wbr 5102
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-ex 1812  df-nf 1816  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rab 3413  df-v 3452  df-ss 3896  df-in 4091  df-un 4151  df-sn 4585  df-pr 4587  df-op 4835  df-int 4907  df-br 5103
This theorem is used by:  brtrclfv  15161
  Copyright terms: Public domain W3C validator