Theorem opelco 5635

Description: Ordered pair membership in a composition. (Contributed by NM, 27-Dec-1996.) (Revised by Mario Carneiro, 24-Feb-2015.)

Hypotheses

Ref	Expression
opelco.1	⊢ 𝐴 ∈ V
opelco.2	⊢ 𝐵 ∈ V

Assertion

Ref	Expression
opelco	⊢ (⟨𝐴, 𝐵⟩ ∈ (𝐶 ∘ 𝐷) ↔ ∃𝑥(𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵))

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

Proof of Theorem opelco

Step	Hyp	Ref	Expression
1		df-br 4969	. 2 ⊢ (𝐴(𝐶 ∘ 𝐷)𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ (𝐶 ∘ 𝐷))
2		opelco.1	. . 3 ⊢ 𝐴 ∈ V
3		opelco.2	. . 3 ⊢ 𝐵 ∈ V
4	2, 3	brco 5634	. 2 ⊢ (𝐴(𝐶 ∘ 𝐷)𝐵 ↔ ∃𝑥(𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵))
5	1, 4	bitr3i 278	1 ⊢ (⟨𝐴, 𝐵⟩ ∈ (𝐶 ∘ 𝐷) ↔ ∃𝑥(𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵))

Syntax hints:   ↔ wb 207   ∧ wa 396  ∃wex 1765   ∈ wcel 2083  Vcvv 3440  ⟨cop 4484   class class class wbr 4968   ∘ ccom 5454

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1781  ax-4 1795  ax-5 1892  ax-6 1951  ax-7 1996  ax-8 2085  ax-9 2093  ax-10 2114  ax-11 2128  ax-12 2143  ax-13 2346  ax-ext 2771  ax-sep 5101  ax-nul 5108  ax-pr 5228

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 843  df-3an 1082  df-tru 1528  df-ex 1766  df-nf 1770  df-sb 2045  df-mo 2578  df-eu 2614  df-clab 2778  df-cleq 2790  df-clel 2865  df-nfc 2937  df-rab 3116  df-v 3442  df-dif 3868  df-un 3870  df-in 3872  df-ss 3880  df-nul 4218  df-if 4388  df-sn 4479  df-pr 4481  df-op 4485  df-br 4969  df-opab 5031  df-co 5459

This theorem is referenced by:  dmcoss  5730  dmcosseq  5732  cotrg  5854  coiun  5991  co02  5995  coi1  5997  coass  6000  fmptco  6761  dftpos4  7769  fmptcof2  30088  cnvco1  32605  cnvco2  32606  txpss3v  32950  dffun10  32986  xrnss3v  35176  coiun1  39503