Theorem br1cossxrnres 39215

Description: ⟨𝐵, 𝐶⟩ and ⟨𝐷, 𝐸⟩ are cosets by an range Cartesian product with a restriction: a binary relation. (Contributed by Peter Mazsa, 8-Jun-2021.)

Assertion

Ref	Expression
br1cossxrnres	⊢ (((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) ∧ (𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌)) → (⟨𝐵, 𝐶⟩ ≀ (𝑅 ⋉ (𝑆 ↾ 𝐴))⟨𝐷, 𝐸⟩ ↔ ∃𝑢 ∈ 𝐴 ((𝑢𝑆𝐶 ∧ 𝑢𝑅𝐵) ∧ (𝑢𝑆𝐸 ∧ 𝑢𝑅𝐷))))

Distinct variable groups:   𝑢,𝐴   𝑢,𝐵   𝑢,𝐶   𝑢,𝐷   𝑢,𝐸   𝑢,𝑅   𝑢,𝑆   𝑢,𝑉   𝑢,𝑊   𝑢,𝑋   𝑢,𝑌

Proof of Theorem br1cossxrnres

Step	Hyp	Ref	Expression
1		xrnres2 39103	. . . 4 ⊢ ((𝑅 ⋉ 𝑆) ↾ 𝐴) = (𝑅 ⋉ (𝑆 ↾ 𝐴))
2	1	cosseqi 39194	. . 3 ⊢ ≀ ((𝑅 ⋉ 𝑆) ↾ 𝐴) = ≀ (𝑅 ⋉ (𝑆 ↾ 𝐴))
3	2	breqi 5114	. 2 ⊢ (⟨𝐵, 𝐶⟩ ≀ ((𝑅 ⋉ 𝑆) ↾ 𝐴)⟨𝐷, 𝐸⟩ ↔ ⟨𝐵, 𝐶⟩ ≀ (𝑅 ⋉ (𝑆 ↾ 𝐴))⟨𝐷, 𝐸⟩)
4		opex 5444	. . . 4 ⊢ ⟨𝐵, 𝐶⟩ ∈ V
5		opex 5444	. . . 4 ⊢ ⟨𝐷, 𝐸⟩ ∈ V
6		br1cossres 39206	. . . 4 ⊢ ((⟨𝐵, 𝐶⟩ ∈ V ∧ ⟨𝐷, 𝐸⟩ ∈ V) → (⟨𝐵, 𝐶⟩ ≀ ((𝑅 ⋉ 𝑆) ↾ 𝐴)⟨𝐷, 𝐸⟩ ↔ ∃𝑢 ∈ 𝐴 (𝑢(𝑅 ⋉ 𝑆)⟨𝐵, 𝐶⟩ ∧ 𝑢(𝑅 ⋉ 𝑆)⟨𝐷, 𝐸⟩)))
7	4, 5, 6	mp2an 704	. . 3 ⊢ (⟨𝐵, 𝐶⟩ ≀ ((𝑅 ⋉ 𝑆) ↾ 𝐴)⟨𝐷, 𝐸⟩ ↔ ∃𝑢 ∈ 𝐴 (𝑢(𝑅 ⋉ 𝑆)⟨𝐵, 𝐶⟩ ∧ 𝑢(𝑅 ⋉ 𝑆)⟨𝐷, 𝐸⟩))
8		brxrn 39060	. . . . . . 7 ⊢ ((𝑢 ∈ V ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (𝑢(𝑅 ⋉ 𝑆)⟨𝐵, 𝐶⟩ ↔ (𝑢𝑅𝐵 ∧ 𝑢𝑆𝐶)))
9	8	el3v1 38907	. . . . . 6 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (𝑢(𝑅 ⋉ 𝑆)⟨𝐵, 𝐶⟩ ↔ (𝑢𝑅𝐵 ∧ 𝑢𝑆𝐶)))
10		brxrn 39060	. . . . . . 7 ⊢ ((𝑢 ∈ V ∧ 𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → (𝑢(𝑅 ⋉ 𝑆)⟨𝐷, 𝐸⟩ ↔ (𝑢𝑅𝐷 ∧ 𝑢𝑆𝐸)))
11	10	el3v1 38907	. . . . . 6 ⊢ ((𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → (𝑢(𝑅 ⋉ 𝑆)⟨𝐷, 𝐸⟩ ↔ (𝑢𝑅𝐷 ∧ 𝑢𝑆𝐸)))
12	9, 11	bi2anan9 649	. . . . 5 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) ∧ (𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌)) → ((𝑢(𝑅 ⋉ 𝑆)⟨𝐵, 𝐶⟩ ∧ 𝑢(𝑅 ⋉ 𝑆)⟨𝐷, 𝐸⟩) ↔ ((𝑢𝑅𝐵 ∧ 𝑢𝑆𝐶) ∧ (𝑢𝑅𝐷 ∧ 𝑢𝑆𝐸))))
13		an2anr 647	. . . . 5 ⊢ (((𝑢𝑅𝐵 ∧ 𝑢𝑆𝐶) ∧ (𝑢𝑅𝐷 ∧ 𝑢𝑆𝐸)) ↔ ((𝑢𝑆𝐶 ∧ 𝑢𝑅𝐵) ∧ (𝑢𝑆𝐸 ∧ 𝑢𝑅𝐷)))
14	12, 13	bitrdi 290	. . . 4 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) ∧ (𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌)) → ((𝑢(𝑅 ⋉ 𝑆)⟨𝐵, 𝐶⟩ ∧ 𝑢(𝑅 ⋉ 𝑆)⟨𝐷, 𝐸⟩) ↔ ((𝑢𝑆𝐶 ∧ 𝑢𝑅𝐵) ∧ (𝑢𝑆𝐸 ∧ 𝑢𝑅𝐷))))
15	14	rexbidv 3188	. . 3 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) ∧ (𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌)) → (∃𝑢 ∈ 𝐴 (𝑢(𝑅 ⋉ 𝑆)⟨𝐵, 𝐶⟩ ∧ 𝑢(𝑅 ⋉ 𝑆)⟨𝐷, 𝐸⟩) ↔ ∃𝑢 ∈ 𝐴 ((𝑢𝑆𝐶 ∧ 𝑢𝑅𝐵) ∧ (𝑢𝑆𝐸 ∧ 𝑢𝑅𝐷))))
16	7, 15	bitrid 286	. 2 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) ∧ (𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌)) → (⟨𝐵, 𝐶⟩ ≀ ((𝑅 ⋉ 𝑆) ↾ 𝐴)⟨𝐷, 𝐸⟩ ↔ ∃𝑢 ∈ 𝐴 ((𝑢𝑆𝐶 ∧ 𝑢𝑅𝐵) ∧ (𝑢𝑆𝐸 ∧ 𝑢𝑅𝐷))))
17	3, 16	bitr3id 288	1 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) ∧ (𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌)) → (⟨𝐵, 𝐶⟩ ≀ (𝑅 ⋉ (𝑆 ↾ 𝐴))⟨𝐷, 𝐸⟩ ↔ ∃𝑢 ∈ 𝐴 ((𝑢𝑆𝐶 ∧ 𝑢𝑅𝐵) ∧ (𝑢𝑆𝐸 ∧ 𝑢𝑅𝐷))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400   ∈ wcel 2142  ∃wrex 3088  Vcvv 3454  ⟨cop 4594   class class class wbr 5108   ↾ cres 5662   ⋉ cxrn 38851   ≀ ccoss 38860

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pr 5403  ax-un 7734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-fo 6542  df-fv 6544  df-1st 7984  df-2nd 7985  df-xrn 39057  df-coss 39178

This theorem is used by:  br1cossxrnidres  39218  br1cossxrncnvepres  39219  br1cossxrncnvssrres  39265