Theorem br1cossres2 39129

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

Step	Hyp	Ref	Expression
1		br1cossres 39128	. 2 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (𝐵 ≀ (𝑅 ↾ 𝐴)𝐶 ↔ ∃𝑥 ∈ 𝐴 (𝑥𝑅𝐵 ∧ 𝑥𝑅𝐶)))
2		exanres3 38901	. 2 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (∃𝑥 ∈ 𝐴 (𝐵 ∈ [𝑥]𝑅 ∧ 𝐶 ∈ [𝑥]𝑅) ↔ ∃𝑥 ∈ 𝐴 (𝑥𝑅𝐵 ∧ 𝑥𝑅𝐶)))
3	1, 2	bitr4d 285	1 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (𝐵 ≀ (𝑅 ↾ 𝐴)𝐶 ↔ ∃𝑥 ∈ 𝐴 (𝐵 ∈ [𝑥]𝑅 ∧ 𝐶 ∈ [𝑥]𝑅)))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   ∈ wcel 2150  ∃wrex 3096   class class class wbr 5114   ↾ cres 5667  [cec 8695   ≀ ccoss 38782

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2152  ax-9 2160  ax-ext 2742  ax-sep 5262  ax-pr 5408

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1571  df-fal 1581  df-ex 1808  df-sb 2099  df-clab 2749  df-cleq 2762  df-clel 2845  df-ral 3087  df-rex 3097  df-rab 3424  df-v 3464  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-br 5115  df-opab 5179  df-xp 5671  df-cnv 5673  df-dm 5675  df-rn 5676  df-res 5677  df-ima 5678  df-ec 8699  df-coss 39100

This theorem is referenced by:  relbrcoss  39135