Theorem brintclab 15057

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 5112	. 2 ⊢ (𝐴∩ {𝑥 ∣ 𝜑}𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ ∩ {𝑥 ∣ 𝜑})
2		opex 5447	. . 3 ⊢ ⟨𝐴, 𝐵⟩ ∈ V
3	2	elintab 4926	. 2 ⊢ (⟨𝐴, 𝐵⟩ ∈ ∩ {𝑥 ∣ 𝜑} ↔ ∀𝑥(𝜑 → ⟨𝐴, 𝐵⟩ ∈ 𝑥))
4	1, 3	bitri 278	1 ⊢ (𝐴∩ {𝑥 ∣ 𝜑}𝐵 ↔ ∀𝑥(𝜑 → ⟨𝐴, 𝐵⟩ ∈ 𝑥))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1568   ∈ wcel 2146  {cab 2743  ⟨cop 4597  ∩ cint 4914   class class class wbr 5111

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-pr 5406

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 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3082  df-rab 3419  df-v 3459  df-un 3911  df-in 3913  df-ss 3923  df-sn 4592  df-pr 4594  df-op 4598  df-int 4915  df-br 5112

This theorem is used by:  brtrclfv  15058