Theorem relbrcoss 38483

Description: 𝐴 and 𝐵 are cosets by relation 𝑅: a binary relation. (Contributed by Peter Mazsa, 22-Apr-2021.)

Assertion

Ref	Expression
relbrcoss	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (Rel 𝑅 → (𝐴 ≀ 𝑅𝐵 ↔ ∃𝑥 ∈ dom 𝑅(𝐴 ∈ [𝑥]𝑅 ∧ 𝐵 ∈ [𝑥]𝑅))))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝑅   𝑥,𝑉   𝑥,𝑊

Proof of Theorem relbrcoss

Step	Hyp	Ref	Expression
1		resdm 5970	. . . . . 6 ⊢ (Rel 𝑅 → (𝑅 ↾ dom 𝑅) = 𝑅)
2	1	cosseqd 38465	. . . . 5 ⊢ (Rel 𝑅 → ≀ (𝑅 ↾ dom 𝑅) = ≀ 𝑅)
3	2	breqd 5097	. . . 4 ⊢ (Rel 𝑅 → (𝐴 ≀ (𝑅 ↾ dom 𝑅)𝐵 ↔ 𝐴 ≀ 𝑅𝐵))
4	3	adantl 481	. . 3 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ Rel 𝑅) → (𝐴 ≀ (𝑅 ↾ dom 𝑅)𝐵 ↔ 𝐴 ≀ 𝑅𝐵))
5		br1cossres2 38477	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 ≀ (𝑅 ↾ dom 𝑅)𝐵 ↔ ∃𝑥 ∈ dom 𝑅(𝐴 ∈ [𝑥]𝑅 ∧ 𝐵 ∈ [𝑥]𝑅)))
6	5	adantr 480	. . 3 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ Rel 𝑅) → (𝐴 ≀ (𝑅 ↾ dom 𝑅)𝐵 ↔ ∃𝑥 ∈ dom 𝑅(𝐴 ∈ [𝑥]𝑅 ∧ 𝐵 ∈ [𝑥]𝑅)))
7	4, 6	bitr3d 281	. 2 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ Rel 𝑅) → (𝐴 ≀ 𝑅𝐵 ↔ ∃𝑥 ∈ dom 𝑅(𝐴 ∈ [𝑥]𝑅 ∧ 𝐵 ∈ [𝑥]𝑅)))
8	7	ex 412	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (Rel 𝑅 → (𝐴 ≀ 𝑅𝐵 ↔ ∃𝑥 ∈ dom 𝑅(𝐴 ∈ [𝑥]𝑅 ∧ 𝐵 ∈ [𝑥]𝑅))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∈ wcel 2111  ∃wrex 3056   class class class wbr 5086  dom cdm 5611   ↾ cres 5613  Rel wrel 5616  [cec 8615   ≀ ccoss 38215

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 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-ext 2703  ax-sep 5229  ax-nul 5239  ax-pr 5365

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2710  df-cleq 2723  df-clel 2806  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4279  df-if 4471  df-sn 4572  df-pr 4574  df-op 4578  df-br 5087  df-opab 5149  df-xp 5617  df-rel 5618  df-cnv 5619  df-dm 5621  df-rn 5622  df-res 5623  df-ima 5624  df-ec 8619  df-coss 38448

This theorem is referenced by:  disjlem18  38838