Users' Mathboxes Mathbox for Peter Mazsa < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  br1cossres Structured version   Visualization version   GIF version

Theorem br1cossres 35711
Description: 𝐵 and 𝐶 are cosets by a restriction: a binary relation. (Contributed by Peter Mazsa, 30-Dec-2018.)
Assertion
Ref Expression
br1cossres ((𝐵𝑉𝐶𝑊) → (𝐵 ≀ (𝑅𝐴)𝐶 ↔ ∃𝑢𝐴 (𝑢𝑅𝐵𝑢𝑅𝐶)))
Distinct variable groups:   𝑢,𝐴   𝑢,𝐵   𝑢,𝐶   𝑢,𝑅   𝑢,𝑉   𝑢,𝑊

Proof of Theorem br1cossres
StepHypRef Expression
1 brcoss 35703 . 2 ((𝐵𝑉𝐶𝑊) → (𝐵 ≀ (𝑅𝐴)𝐶 ↔ ∃𝑢(𝑢(𝑅𝐴)𝐵𝑢(𝑅𝐴)𝐶)))
2 exanres 35579 . 2 ((𝐵𝑉𝐶𝑊) → (∃𝑢(𝑢(𝑅𝐴)𝐵𝑢(𝑅𝐴)𝐶) ↔ ∃𝑢𝐴 (𝑢𝑅𝐵𝑢𝑅𝐶)))
31, 2bitrd 281 1 ((𝐵𝑉𝐶𝑊) → (𝐵 ≀ (𝑅𝐴)𝐶 ↔ ∃𝑢𝐴 (𝑢𝑅𝐵𝑢𝑅𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398  wex 1780  wcel 2114  wrex 3134   class class class wbr 5047  cres 5538  ccoss 35480
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2792  ax-sep 5184  ax-nul 5191  ax-pr 5311
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2653  df-clab 2799  df-cleq 2813  df-clel 2891  df-nfc 2959  df-ral 3138  df-rex 3139  df-rab 3142  df-v 3483  df-dif 3922  df-un 3924  df-in 3926  df-ss 3935  df-nul 4275  df-if 4449  df-sn 4549  df-pr 4551  df-op 4555  df-br 5048  df-opab 5110  df-xp 5542  df-res 5548  df-coss 35686
This theorem is referenced by:  br1cossres2  35712  br1cossinres  35714  br1cossxrnres  35715
  Copyright terms: Public domain W3C validator