Theorem braba 5493

Description: The law of concretion for a binary relation. (Contributed by NM, 19-Dec-2013.)

Hypotheses

Ref	Expression
opelopaba.1	⊢ 𝐴 ∈ V
opelopaba.2	⊢ 𝐵 ∈ V
opelopaba.3	⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝜑 ↔ 𝜓))
braba.4	⊢ 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝜑}

Assertion

Ref	Expression
braba	⊢ (𝐴𝑅𝐵 ↔ 𝜓)

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝜓,𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦)   𝑅(𝑥,𝑦)

Proof of Theorem braba

Step	Hyp	Ref	Expression
1		opelopaba.1	. 2 ⊢ 𝐴 ∈ V
2		opelopaba.2	. 2 ⊢ 𝐵 ∈ V
3		opelopaba.3	. . 3 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝜑 ↔ 𝜓))
4		braba.4	. . 3 ⊢ 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝜑}
5	3, 4	brabga 5490	. 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴𝑅𝐵 ↔ 𝜓))
6	1, 2, 5	mp2an 693	1 ⊢ (𝐴𝑅𝐵 ↔ 𝜓)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114  Vcvv 3442   class class class wbr 5100  {copab 5162

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5243  ax-pr 5379

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-br 5101  df-opab 5163

This theorem is referenced by:  frgpuplem  19713  2ndcctbss  23411  legov  28669  prtlem13  39244  wepwsolem  43399  fnwe2val  43406  grumnud  44642  lambert0  47247  lamberte  47248  sinnpoly  47251  sprsymrelf  47855  catprsc  49372  catprsc2  49373