| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > br1cossxrnres | Structured version Visualization version GIF version | ||
| Description: 〈𝐵, 𝐶〉 and 〈𝐷, 𝐸〉 are cosets by an range Cartesian product with a restriction: a binary relation. (Contributed by Peter Mazsa, 8-Jun-2021.) |
| Ref | Expression |
|---|---|
| br1cossxrnres | ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) ∧ (𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌)) → (〈𝐵, 𝐶〉 ≀ (𝑅 ⋉ (𝑆 ↾ 𝐴))〈𝐷, 𝐸〉 ↔ ∃𝑢 ∈ 𝐴 ((𝑢𝑆𝐶 ∧ 𝑢𝑅𝐵) ∧ (𝑢𝑆𝐸 ∧ 𝑢𝑅𝐷)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | xrnres2 38389 | . . . 4 ⊢ ((𝑅 ⋉ 𝑆) ↾ 𝐴) = (𝑅 ⋉ (𝑆 ↾ 𝐴)) | |
| 2 | 1 | cosseqi 38418 | . . 3 ⊢ ≀ ((𝑅 ⋉ 𝑆) ↾ 𝐴) = ≀ (𝑅 ⋉ (𝑆 ↾ 𝐴)) |
| 3 | 2 | breqi 5113 | . 2 ⊢ (〈𝐵, 𝐶〉 ≀ ((𝑅 ⋉ 𝑆) ↾ 𝐴)〈𝐷, 𝐸〉 ↔ 〈𝐵, 𝐶〉 ≀ (𝑅 ⋉ (𝑆 ↾ 𝐴))〈𝐷, 𝐸〉) |
| 4 | opex 5424 | . . . 4 ⊢ 〈𝐵, 𝐶〉 ∈ V | |
| 5 | opex 5424 | . . . 4 ⊢ 〈𝐷, 𝐸〉 ∈ V | |
| 6 | br1cossres 38430 | . . . 4 ⊢ ((〈𝐵, 𝐶〉 ∈ V ∧ 〈𝐷, 𝐸〉 ∈ V) → (〈𝐵, 𝐶〉 ≀ ((𝑅 ⋉ 𝑆) ↾ 𝐴)〈𝐷, 𝐸〉 ↔ ∃𝑢 ∈ 𝐴 (𝑢(𝑅 ⋉ 𝑆)〈𝐵, 𝐶〉 ∧ 𝑢(𝑅 ⋉ 𝑆)〈𝐷, 𝐸〉))) | |
| 7 | 4, 5, 6 | mp2an 692 | . . 3 ⊢ (〈𝐵, 𝐶〉 ≀ ((𝑅 ⋉ 𝑆) ↾ 𝐴)〈𝐷, 𝐸〉 ↔ ∃𝑢 ∈ 𝐴 (𝑢(𝑅 ⋉ 𝑆)〈𝐵, 𝐶〉 ∧ 𝑢(𝑅 ⋉ 𝑆)〈𝐷, 𝐸〉)) |
| 8 | brxrn 38356 | . . . . . . 7 ⊢ ((𝑢 ∈ V ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (𝑢(𝑅 ⋉ 𝑆)〈𝐵, 𝐶〉 ↔ (𝑢𝑅𝐵 ∧ 𝑢𝑆𝐶))) | |
| 9 | 8 | el3v1 38212 | . . . . . 6 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (𝑢(𝑅 ⋉ 𝑆)〈𝐵, 𝐶〉 ↔ (𝑢𝑅𝐵 ∧ 𝑢𝑆𝐶))) |
| 10 | brxrn 38356 | . . . . . . 7 ⊢ ((𝑢 ∈ V ∧ 𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → (𝑢(𝑅 ⋉ 𝑆)〈𝐷, 𝐸〉 ↔ (𝑢𝑅𝐷 ∧ 𝑢𝑆𝐸))) | |
| 11 | 10 | el3v1 38212 | . . . . . 6 ⊢ ((𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → (𝑢(𝑅 ⋉ 𝑆)〈𝐷, 𝐸〉 ↔ (𝑢𝑅𝐷 ∧ 𝑢𝑆𝐸))) |
| 12 | 9, 11 | bi2anan9 638 | . . . . 5 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) ∧ (𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌)) → ((𝑢(𝑅 ⋉ 𝑆)〈𝐵, 𝐶〉 ∧ 𝑢(𝑅 ⋉ 𝑆)〈𝐷, 𝐸〉) ↔ ((𝑢𝑅𝐵 ∧ 𝑢𝑆𝐶) ∧ (𝑢𝑅𝐷 ∧ 𝑢𝑆𝐸)))) |
| 13 | an2anr 636 | . . . . 5 ⊢ (((𝑢𝑅𝐵 ∧ 𝑢𝑆𝐶) ∧ (𝑢𝑅𝐷 ∧ 𝑢𝑆𝐸)) ↔ ((𝑢𝑆𝐶 ∧ 𝑢𝑅𝐵) ∧ (𝑢𝑆𝐸 ∧ 𝑢𝑅𝐷))) | |
| 14 | 12, 13 | bitrdi 287 | . . . 4 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) ∧ (𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌)) → ((𝑢(𝑅 ⋉ 𝑆)〈𝐵, 𝐶〉 ∧ 𝑢(𝑅 ⋉ 𝑆)〈𝐷, 𝐸〉) ↔ ((𝑢𝑆𝐶 ∧ 𝑢𝑅𝐵) ∧ (𝑢𝑆𝐸 ∧ 𝑢𝑅𝐷)))) |
| 15 | 14 | rexbidv 3157 | . . 3 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) ∧ (𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌)) → (∃𝑢 ∈ 𝐴 (𝑢(𝑅 ⋉ 𝑆)〈𝐵, 𝐶〉 ∧ 𝑢(𝑅 ⋉ 𝑆)〈𝐷, 𝐸〉) ↔ ∃𝑢 ∈ 𝐴 ((𝑢𝑆𝐶 ∧ 𝑢𝑅𝐵) ∧ (𝑢𝑆𝐸 ∧ 𝑢𝑅𝐷)))) |
| 16 | 7, 15 | bitrid 283 | . 2 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) ∧ (𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌)) → (〈𝐵, 𝐶〉 ≀ ((𝑅 ⋉ 𝑆) ↾ 𝐴)〈𝐷, 𝐸〉 ↔ ∃𝑢 ∈ 𝐴 ((𝑢𝑆𝐶 ∧ 𝑢𝑅𝐵) ∧ (𝑢𝑆𝐸 ∧ 𝑢𝑅𝐷)))) |
| 17 | 3, 16 | bitr3id 285 | 1 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) ∧ (𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌)) → (〈𝐵, 𝐶〉 ≀ (𝑅 ⋉ (𝑆 ↾ 𝐴))〈𝐷, 𝐸〉 ↔ ∃𝑢 ∈ 𝐴 ((𝑢𝑆𝐶 ∧ 𝑢𝑅𝐵) ∧ (𝑢𝑆𝐸 ∧ 𝑢𝑅𝐷)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2109 ∃wrex 3053 Vcvv 3447 〈cop 4595 class class class wbr 5107 ↾ cres 5640 ⋉ cxrn 38168 ≀ ccoss 38169 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pr 5387 ax-un 7711 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4297 df-if 4489 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-br 5108 df-opab 5170 df-mpt 5189 df-id 5533 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-fo 6517 df-fv 6519 df-1st 7968 df-2nd 7969 df-xrn 38353 df-coss 38402 |
| This theorem is referenced by: br1cossxrnidres 38442 br1cossxrncnvepres 38443 br1cossxrncnvssrres 38499 |
| Copyright terms: Public domain | W3C validator |