Theorem opelco 5855

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 5108	. 2 ⊢ (𝐴(𝐶 ∘ 𝐷)𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ (𝐶 ∘ 𝐷))
2		opelco.1	. . 3 ⊢ 𝐴 ∈ V
3		opelco.2	. . 3 ⊢ 𝐵 ∈ V
4	2, 3	brco 5854	. 2 ⊢ (𝐴(𝐶 ∘ 𝐷)𝐵 ↔ ∃𝑥(𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵))
5	1, 4	bitr3i 280	1 ⊢ (⟨𝐴, 𝐵⟩ ∈ (𝐶 ∘ 𝐷) ↔ ∃𝑥(𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401  ∃wex 1812   ∈ wcel 2145  Vcvv 3453  ⟨cop 4593   class class class wbr 5107   ∘ ccom 5663

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 2147  ax-9 2155  ax-ext 2734  ax-sep 5255  ax-pr 5402

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-br 5108  df-opab 5172  df-co 5668

This theorem is used by:  dmcoss  5963  dmcossOLD  5964  dmcosseq  5966  dmcosseqOLD  5967  coiun  6257  co02  6261  coi1  6263  coass  6266  fmptco  7126  dftpos4  8246  ttrcltr  9698  fmptcof2  33117  cnvco1  36325  cnvco2  36326  txpss3v  36442  dffun10  36478  xrnss3v  39116  coiun1  44479  coxp  49748