Theorem brcog 5731

Description: Ordered pair membership in a composition. (Contributed by NM, 24-Feb-2015.)

Assertion

Ref	Expression
brcog	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴(𝐶 ∘ 𝐷)𝐵 ↔ ∃𝑥(𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵)))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶   𝑥,𝐷

Allowed substitution hints:   𝑉(𝑥)   𝑊(𝑥)

Proof of Theorem brcog

Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		breq1 5061	. . . 4 ⊢ (𝑦 = 𝐴 → (𝑦𝐷𝑥 ↔ 𝐴𝐷𝑥))
2		breq2 5062	. . . 4 ⊢ (𝑧 = 𝐵 → (𝑥𝐶𝑧 ↔ 𝑥𝐶𝐵))
3	1, 2	bi2anan9 637	. . 3 ⊢ ((𝑦 = 𝐴 ∧ 𝑧 = 𝐵) → ((𝑦𝐷𝑥 ∧ 𝑥𝐶𝑧) ↔ (𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵)))
4	3	exbidv 1918	. 2 ⊢ ((𝑦 = 𝐴 ∧ 𝑧 = 𝐵) → (∃𝑥(𝑦𝐷𝑥 ∧ 𝑥𝐶𝑧) ↔ ∃𝑥(𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵)))
5		df-co 5558	. 2 ⊢ (𝐶 ∘ 𝐷) = {⟨𝑦, 𝑧⟩ ∣ ∃𝑥(𝑦𝐷𝑥 ∧ 𝑥𝐶𝑧)}
6	4, 5	brabga 5413	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴(𝐶 ∘ 𝐷)𝐵 ↔ ∃𝑥(𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵)))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   = wceq 1533  ∃wex 1776   ∈ wcel 2110   class class class wbr 5058   ∘ ccom 5553

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5195  ax-nul 5202  ax-pr 5321

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-rab 3147  df-v 3496  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4561  df-pr 4563  df-op 4567  df-br 5059  df-opab 5121  df-co 5558

This theorem is referenced by:  opelco2g  5732  brcogw  5733  brco  5735  brcodir  5973  brtpos2  7892  ertr  8298  relexpindlem  14416  znleval  20695  fcoinvbr  30352  opelco3  33013  brxrn  35620  eqvreltr  35836  frege124d  40099  funressnfv  43272  dfatcolem  43448