Theorem br1cossxrnres 38920

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 38808	. . . 4 ⊢ ((𝑅 ⋉ 𝑆) ↾ 𝐴) = (𝑅 ⋉ (𝑆 ↾ 𝐴))
2	1	cosseqi 38899	. . 3 ⊢ ≀ ((𝑅 ⋉ 𝑆) ↾ 𝐴) = ≀ (𝑅 ⋉ (𝑆 ↾ 𝐴))
3	2	breqi 5081	. 2 ⊢ (⟨𝐵, 𝐶⟩ ≀ ((𝑅 ⋉ 𝑆) ↾ 𝐴)⟨𝐷, 𝐸⟩ ↔ ⟨𝐵, 𝐶⟩ ≀ (𝑅 ⋉ (𝑆 ↾ 𝐴))⟨𝐷, 𝐸⟩)
4		opex 5406	. . . 4 ⊢ ⟨𝐵, 𝐶⟩ ∈ V
5		opex 5406	. . . 4 ⊢ ⟨𝐷, 𝐸⟩ ∈ V
6		br1cossres 38911	. . . 4 ⊢ ((⟨𝐵, 𝐶⟩ ∈ V ∧ ⟨𝐷, 𝐸⟩ ∈ V) → (⟨𝐵, 𝐶⟩ ≀ ((𝑅 ⋉ 𝑆) ↾ 𝐴)⟨𝐷, 𝐸⟩ ↔ ∃𝑢 ∈ 𝐴 (𝑢(𝑅 ⋉ 𝑆)⟨𝐵, 𝐶⟩ ∧ 𝑢(𝑅 ⋉ 𝑆)⟨𝐷, 𝐸⟩)))
7	4, 5, 6	mp2an 699	. . 3 ⊢ (⟨𝐵, 𝐶⟩ ≀ ((𝑅 ⋉ 𝑆) ↾ 𝐴)⟨𝐷, 𝐸⟩ ↔ ∃𝑢 ∈ 𝐴 (𝑢(𝑅 ⋉ 𝑆)⟨𝐵, 𝐶⟩ ∧ 𝑢(𝑅 ⋉ 𝑆)⟨𝐷, 𝐸⟩))
8		brxrn 38765	. . . . . . 7 ⊢ ((𝑢 ∈ V ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (𝑢(𝑅 ⋉ 𝑆)⟨𝐵, 𝐶⟩ ↔ (𝑢𝑅𝐵 ∧ 𝑢𝑆𝐶)))
9	8	el3v1 38612	. . . . . 6 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (𝑢(𝑅 ⋉ 𝑆)⟨𝐵, 𝐶⟩ ↔ (𝑢𝑅𝐵 ∧ 𝑢𝑆𝐶)))
10		brxrn 38765	. . . . . . 7 ⊢ ((𝑢 ∈ V ∧ 𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → (𝑢(𝑅 ⋉ 𝑆)⟨𝐷, 𝐸⟩ ↔ (𝑢𝑅𝐷 ∧ 𝑢𝑆𝐸)))
11	10	el3v1 38612	. . . . . 6 ⊢ ((𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → (𝑢(𝑅 ⋉ 𝑆)⟨𝐷, 𝐸⟩ ↔ (𝑢𝑅𝐷 ∧ 𝑢𝑆𝐸)))
12	9, 11	bi2anan9 645	. . . . 5 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) ∧ (𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌)) → ((𝑢(𝑅 ⋉ 𝑆)⟨𝐵, 𝐶⟩ ∧ 𝑢(𝑅 ⋉ 𝑆)⟨𝐷, 𝐸⟩) ↔ ((𝑢𝑅𝐵 ∧ 𝑢𝑆𝐶) ∧ (𝑢𝑅𝐷 ∧ 𝑢𝑆𝐸))))
13		an2anr 643	. . . . 5 ⊢ (((𝑢𝑅𝐵 ∧ 𝑢𝑆𝐶) ∧ (𝑢𝑅𝐷 ∧ 𝑢𝑆𝐸)) ↔ ((𝑢𝑆𝐶 ∧ 𝑢𝑅𝐵) ∧ (𝑢𝑆𝐸 ∧ 𝑢𝑅𝐷)))
14	12, 13	bitrdi 289	. . . 4 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) ∧ (𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌)) → ((𝑢(𝑅 ⋉ 𝑆)⟨𝐵, 𝐶⟩ ∧ 𝑢(𝑅 ⋉ 𝑆)⟨𝐷, 𝐸⟩) ↔ ((𝑢𝑆𝐶 ∧ 𝑢𝑅𝐵) ∧ (𝑢𝑆𝐸 ∧ 𝑢𝑅𝐷))))
15	14	rexbidv 3165	. . 3 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) ∧ (𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌)) → (∃𝑢 ∈ 𝐴 (𝑢(𝑅 ⋉ 𝑆)⟨𝐵, 𝐶⟩ ∧ 𝑢(𝑅 ⋉ 𝑆)⟨𝐷, 𝐸⟩) ↔ ∃𝑢 ∈ 𝐴 ((𝑢𝑆𝐶 ∧ 𝑢𝑅𝐵) ∧ (𝑢𝑆𝐸 ∧ 𝑢𝑅𝐷))))
16	7, 15	bitrid 285	. 2 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) ∧ (𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌)) → (⟨𝐵, 𝐶⟩ ≀ ((𝑅 ⋉ 𝑆) ↾ 𝐴)⟨𝐷, 𝐸⟩ ↔ ∃𝑢 ∈ 𝐴 ((𝑢𝑆𝐶 ∧ 𝑢𝑅𝐵) ∧ (𝑢𝑆𝐸 ∧ 𝑢𝑅𝐷))))
17	3, 16	bitr3id 287	1 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) ∧ (𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌)) → (⟨𝐵, 𝐶⟩ ≀ (𝑅 ⋉ (𝑆 ↾ 𝐴))⟨𝐷, 𝐸⟩ ↔ ∃𝑢 ∈ 𝐴 ((𝑢𝑆𝐶 ∧ 𝑢𝑅𝐵) ∧ (𝑢𝑆𝐸 ∧ 𝑢𝑅𝐷))))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 397   ∈ wcel 2121  ∃wrex 3065  Vcvv 3433  ⟨cop 4564   class class class wbr 5075   ↾ cres 5623   ⋉ cxrn 38556   ≀ ccoss 38565

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-sep 5221  ax-nul 5231  ax-pr 5365  ax-un 7682

This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ne 2937  df-ral 3056  df-rex 3066  df-rab 3394  df-v 3435  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-nul 4265  df-if 4458  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4842  df-br 5076  df-opab 5138  df-mpt 5157  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-fo 6495  df-fv 6497  df-1st 7935  df-2nd 7936  df-xrn 38762  df-coss 38883

This theorem is referenced by:  br1cossxrnidres  38923  br1cossxrncnvepres  38924  br1cossxrncnvssrres  38970