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

Theorem br1cossres2 35565
Description: 𝐵 and 𝐶 are cosets by a restriction: a binary relation. (Contributed by Peter Mazsa, 3-Jan-2018.)
Assertion
Ref Expression
br1cossres2 ((𝐵𝑉𝐶𝑊) → (𝐵 ≀ (𝑅𝐴)𝐶 ↔ ∃𝑥𝐴 (𝐵 ∈ [𝑥]𝑅𝐶 ∈ [𝑥]𝑅)))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶   𝑥,𝑅   𝑥,𝑉   𝑥,𝑊

Proof of Theorem br1cossres2
StepHypRef Expression
1 br1cossres 35564 . 2 ((𝐵𝑉𝐶𝑊) → (𝐵 ≀ (𝑅𝐴)𝐶 ↔ ∃𝑥𝐴 (𝑥𝑅𝐵𝑥𝑅𝐶)))
2 exanres3 35434 . 2 ((𝐵𝑉𝐶𝑊) → (∃𝑥𝐴 (𝐵 ∈ [𝑥]𝑅𝐶 ∈ [𝑥]𝑅) ↔ ∃𝑥𝐴 (𝑥𝑅𝐵𝑥𝑅𝐶)))
31, 2bitr4d 283 1 ((𝐵𝑉𝐶𝑊) → (𝐵 ≀ (𝑅𝐴)𝐶 ↔ ∃𝑥𝐴 (𝐵 ∈ [𝑥]𝑅𝐶 ∈ [𝑥]𝑅)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396  wcel 2105  wrex 3136   class class class wbr 5057  cres 5550  [cec 8276  ccoss 35334
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2151  ax-12 2167  ax-ext 2790  ax-sep 5194  ax-nul 5201  ax-pr 5320
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-3an 1081  df-tru 1531  df-ex 1772  df-nf 1776  df-sb 2061  df-mo 2615  df-eu 2647  df-clab 2797  df-cleq 2811  df-clel 2890  df-nfc 2960  df-ral 3140  df-rex 3141  df-rab 3144  df-v 3494  df-sbc 3770  df-dif 3936  df-un 3938  df-in 3940  df-ss 3949  df-nul 4289  df-if 4464  df-sn 4558  df-pr 4560  df-op 4564  df-br 5058  df-opab 5120  df-xp 5554  df-cnv 5556  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-ec 8280  df-coss 35539
This theorem is referenced by:  relbrcoss  35566
  Copyright terms: Public domain W3C validator