Theorem brintclab 15195

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

Step	Hyp	Ref	Expression
1		df-br 5107	. 2 ⊢ (𝐴∩ {𝑥 ∣ 𝜑}𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ ∩ {𝑥 ∣ 𝜑})
2		opex 5437	. . 3 ⊢ ⟨𝐴, 𝐵⟩ ∈ V
3	2	elintab 4922	. 2 ⊢ (⟨𝐴, 𝐵⟩ ∈ ∩ {𝑥 ∣ 𝜑} ↔ ∀𝑥(𝜑 → ⟨𝐴, 𝐵⟩ ∈ 𝑥))
4	1, 3	bitri 278	1 ⊢ (𝐴∩ {𝑥 ∣ 𝜑}𝐵 ↔ ∀𝑥(𝜑 → ⟨𝐴, 𝐵⟩ ∈ 𝑥))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1568   ∈ wcel 2147  {cab 2741  ⟨cop 4838  ∩ cint 4910   class class class wbr 5106

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-pr 5396

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rab 3417  df-v 3456  df-ss 3901  df-in 4094  df-un 4154  df-sn 4589  df-pr 4591  df-op 4839  df-int 4911  df-br 5107

This theorem is used by:  brtrclfv  15196