MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  opelco Structured version   Unicode version

Theorem opelco 5114
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  |-  A  e. 
_V
opelco.2  |-  B  e. 
_V
Assertion
Ref Expression
opelco  |-  ( <. A ,  B >.  e.  ( C  o.  D
)  <->  E. x ( A D x  /\  x C B ) )
Distinct variable groups:    x, A    x, B    x, C    x, D

Proof of Theorem opelco
StepHypRef Expression
1 df-br 4393 . 2  |-  ( A ( C  o.  D
) B  <->  <. A ,  B >.  e.  ( C  o.  D ) )
2 opelco.1 . . 3  |-  A  e. 
_V
3 opelco.2 . . 3  |-  B  e. 
_V
42, 3brco 5113 . 2  |-  ( A ( C  o.  D
) B  <->  E. x
( A D x  /\  x C B ) )
51, 4bitr3i 251 1  |-  ( <. A ,  B >.  e.  ( C  o.  D
)  <->  E. x ( A D x  /\  x C B ) )
Colors of variables: wff setvar class
Syntax hints:    <-> wb 184    /\ wa 367   E.wex 1631    e. wcel 1840   _Vcvv 3056   <.cop 3975   class class class wbr 4392    o. ccom 4944
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1637  ax-4 1650  ax-5 1723  ax-6 1769  ax-7 1812  ax-9 1844  ax-10 1859  ax-11 1864  ax-12 1876  ax-13 2024  ax-ext 2378  ax-sep 4514  ax-nul 4522  ax-pr 4627
This theorem depends on definitions:  df-bi 185  df-or 368  df-an 369  df-3an 974  df-tru 1406  df-ex 1632  df-nf 1636  df-sb 1762  df-eu 2240  df-mo 2241  df-clab 2386  df-cleq 2392  df-clel 2395  df-nfc 2550  df-ne 2598  df-rab 2760  df-v 3058  df-dif 3414  df-un 3416  df-in 3418  df-ss 3425  df-nul 3736  df-if 3883  df-sn 3970  df-pr 3972  df-op 3976  df-br 4393  df-opab 4451  df-co 4949
This theorem is referenced by:  dmcoss  5202  dmcosseq  5204  cotrg  5318  coiun  5452  co02  5456  coi1  5458  coass  5461  fmptco  5997  dftpos4  6929  fmptcof2  27822  cnvco1  29854  cnvco2  29855  txpss3v  30184  dffun10  30220  coiun1  35595
  Copyright terms: Public domain W3C validator