MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  brcog Structured version   Visualization version   GIF version

Theorem brcog 5838
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.
StepHypRef Expression
1 breq1 5103 . . . 4 (𝑦 = 𝐴 → (𝑦𝐷𝑥𝐴𝐷𝑥))
2 breq2 5104 . . . 4 (𝑧 = 𝐵 → (𝑥𝐶𝑧𝑥𝐶𝐵))
31, 2bi2anan9 647 . . 3 ((𝑦 = 𝐴𝑧 = 𝐵) → ((𝑦𝐷𝑥𝑥𝐶𝑧) ↔ (𝐴𝐷𝑥𝑥𝐶𝐵)))
43exbidv 1941 . 2 ((𝑦 = 𝐴𝑧 = 𝐵) → (∃𝑥(𝑦𝐷𝑥𝑥𝐶𝑧) ↔ ∃𝑥(𝐴𝐷𝑥𝑥𝐶𝐵)))
5 df-co 5656 . 2 (𝐶𝐷) = {⟨𝑦, 𝑧⟩ ∣ ∃𝑥(𝑦𝐷𝑥𝑥𝐶𝑧)}
64, 5brabga 5504 1 ((𝐴𝑉𝐵𝑊) → (𝐴(𝐶𝐷)𝐵 ↔ ∃𝑥(𝐴𝐷𝑥𝑥𝐶𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399   = wceq 1560  wex 1799  wcel 2142   class class class wbr 5100  ccom 5651
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-ext 2734  ax-sep 5246  ax-pr 5390
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-sb 2091  df-clab 2741  df-cleq 2754  df-clel 2837  df-rab 3415  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4481  df-sn 4583  df-pr 4585  df-op 4589  df-br 5101  df-opab 5163  df-co 5656
This theorem is referenced by:  opelco2g  5839  brcogw  5840  brco  5842  brcodir  6106  predtrss  6309  brtpos2  8212  ertr  8694  relexpindlem  15076  znleval  21606  fcoinvbr  32805  opelco3  36125  brxrn  38882  eqvreltr  39190  frege124d  44337  funressnfv  47637  dfatcolem  47849
  Copyright terms: Public domain W3C validator