Theorem br1cossxrnres 39384

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 39272	. . . 4 ⊢ ((𝑅 ⋉ 𝑆) ↾ 𝐴) = (𝑅 ⋉ (𝑆 ↾ 𝐴))
2	1	cosseqi 39363	. . 3 ⊢ ≀ ((𝑅 ⋉ 𝑆) ↾ 𝐴) = ≀ (𝑅 ⋉ (𝑆 ↾ 𝐴))
3	2	breqi 5109	. 2 ⊢ (⟨𝐵, 𝐶⟩ ≀ ((𝑅 ⋉ 𝑆) ↾ 𝐴)⟨𝐷, 𝐸⟩ ↔ ⟨𝐵, 𝐶⟩ ≀ (𝑅 ⋉ (𝑆 ↾ 𝐴))⟨𝐷, 𝐸⟩)
4		opex 5432	. . . 4 ⊢ ⟨𝐵, 𝐶⟩ ∈ V
5		opex 5432	. . . 4 ⊢ ⟨𝐷, 𝐸⟩ ∈ V
6		br1cossres 39375	. . . 4 ⊢ ((⟨𝐵, 𝐶⟩ ∈ V ∧ ⟨𝐷, 𝐸⟩ ∈ V) → (⟨𝐵, 𝐶⟩ ≀ ((𝑅 ⋉ 𝑆) ↾ 𝐴)⟨𝐷, 𝐸⟩ ↔ ∃𝑢 ∈ 𝐴 (𝑢(𝑅 ⋉ 𝑆)⟨𝐵, 𝐶⟩ ∧ 𝑢(𝑅 ⋉ 𝑆)⟨𝐷, 𝐸⟩)))
7	4, 5, 6	mp2an 705	. . 3 ⊢ (⟨𝐵, 𝐶⟩ ≀ ((𝑅 ⋉ 𝑆) ↾ 𝐴)⟨𝐷, 𝐸⟩ ↔ ∃𝑢 ∈ 𝐴 (𝑢(𝑅 ⋉ 𝑆)⟨𝐵, 𝐶⟩ ∧ 𝑢(𝑅 ⋉ 𝑆)⟨𝐷, 𝐸⟩))
8		brxrn 39229	. . . . . . 7 ⊢ ((𝑢 ∈ V ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (𝑢(𝑅 ⋉ 𝑆)⟨𝐵, 𝐶⟩ ↔ (𝑢𝑅𝐵 ∧ 𝑢𝑆𝐶)))
9	8	el3v1 39076	. . . . . 6 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (𝑢(𝑅 ⋉ 𝑆)⟨𝐵, 𝐶⟩ ↔ (𝑢𝑅𝐵 ∧ 𝑢𝑆𝐶)))
10		brxrn 39229	. . . . . . 7 ⊢ ((𝑢 ∈ V ∧ 𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → (𝑢(𝑅 ⋉ 𝑆)⟨𝐷, 𝐸⟩ ↔ (𝑢𝑅𝐷 ∧ 𝑢𝑆𝐸)))
11	10	el3v1 39076	. . . . . 6 ⊢ ((𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → (𝑢(𝑅 ⋉ 𝑆)⟨𝐷, 𝐸⟩ ↔ (𝑢𝑅𝐷 ∧ 𝑢𝑆𝐸)))
12	9, 11	bi2anan9 650	. . . . 5 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) ∧ (𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌)) → ((𝑢(𝑅 ⋉ 𝑆)⟨𝐵, 𝐶⟩ ∧ 𝑢(𝑅 ⋉ 𝑆)⟨𝐷, 𝐸⟩) ↔ ((𝑢𝑅𝐵 ∧ 𝑢𝑆𝐶) ∧ (𝑢𝑅𝐷 ∧ 𝑢𝑆𝐸))))
13		an2anr 648	. . . . 5 ⊢ (((𝑢𝑅𝐵 ∧ 𝑢𝑆𝐶) ∧ (𝑢𝑅𝐷 ∧ 𝑢𝑆𝐸)) ↔ ((𝑢𝑆𝐶 ∧ 𝑢𝑅𝐵) ∧ (𝑢𝑆𝐸 ∧ 𝑢𝑅𝐷)))
14	12, 13	bitrdi 290	. . . 4 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) ∧ (𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌)) → ((𝑢(𝑅 ⋉ 𝑆)⟨𝐵, 𝐶⟩ ∧ 𝑢(𝑅 ⋉ 𝑆)⟨𝐷, 𝐸⟩) ↔ ((𝑢𝑆𝐶 ∧ 𝑢𝑅𝐵) ∧ (𝑢𝑆𝐸 ∧ 𝑢𝑅𝐷))))
15	14	rexbidv 3186	. . 3 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) ∧ (𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌)) → (∃𝑢 ∈ 𝐴 (𝑢(𝑅 ⋉ 𝑆)⟨𝐵, 𝐶⟩ ∧ 𝑢(𝑅 ⋉ 𝑆)⟨𝐷, 𝐸⟩) ↔ ∃𝑢 ∈ 𝐴 ((𝑢𝑆𝐶 ∧ 𝑢𝑅𝐵) ∧ (𝑢𝑆𝐸 ∧ 𝑢𝑅𝐷))))
16	7, 15	bitrid 286	. 2 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) ∧ (𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌)) → (⟨𝐵, 𝐶⟩ ≀ ((𝑅 ⋉ 𝑆) ↾ 𝐴)⟨𝐷, 𝐸⟩ ↔ ∃𝑢 ∈ 𝐴 ((𝑢𝑆𝐶 ∧ 𝑢𝑅𝐵) ∧ (𝑢𝑆𝐸 ∧ 𝑢𝑅𝐷))))
17	3, 16	bitr3id 288	1 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) ∧ (𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌)) → (⟨𝐵, 𝐶⟩ ≀ (𝑅 ⋉ (𝑆 ↾ 𝐴))⟨𝐷, 𝐸⟩ ↔ ∃𝑢 ∈ 𝐴 ((𝑢𝑆𝐶 ∧ 𝑢𝑅𝐵) ∧ (𝑢𝑆𝐸 ∧ 𝑢𝑅𝐷))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∈ wcel 2145  ∃wrex 3086  Vcvv 3450  ⟨cop 4590   class class class wbr 5103   ↾ cres 5650   ⋉ cxrn 39020   ≀ ccoss 39029

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5543  df-xp 5654  df-rel 5655  df-cnv 5656  df-co 5657  df-dm 5658  df-rn 5659  df-res 5660  df-iota 6484  df-fun 6530  df-fn 6531  df-f 6532  df-fo 6534  df-fv 6536  df-1st 7985  df-2nd 7986  df-xrn 39226  df-coss 39347

This theorem is used by:  br1cossxrnidres  39387  br1cossxrncnvepres  39388  br1cossxrncnvssrres  39434