| 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 39025 | . . . 4 ⊢ ((𝑅 ⋉ 𝑆) ↾ 𝐴) = (𝑅 ⋉ (𝑆 ↾ 𝐴)) | |
| 2 | 1 | cosseqi 39116 | . . 3 ⊢ ≀ ((𝑅 ⋉ 𝑆) ↾ 𝐴) = ≀ (𝑅 ⋉ (𝑆 ↾ 𝐴)) |
| 3 | 2 | breqi 5120 | . 2 ⊢ (〈𝐵, 𝐶〉 ≀ ((𝑅 ⋉ 𝑆) ↾ 𝐴)〈𝐷, 𝐸〉 ↔ 〈𝐵, 𝐶〉 ≀ (𝑅 ⋉ (𝑆 ↾ 𝐴))〈𝐷, 𝐸〉) |
| 4 | opex 5449 | . . . 4 ⊢ 〈𝐵, 𝐶〉 ∈ V | |
| 5 | opex 5449 | . . . 4 ⊢ 〈𝐷, 𝐸〉 ∈ V | |
| 6 | br1cossres 39128 | . . . 4 ⊢ ((〈𝐵, 𝐶〉 ∈ V ∧ 〈𝐷, 𝐸〉 ∈ V) → (〈𝐵, 𝐶〉 ≀ ((𝑅 ⋉ 𝑆) ↾ 𝐴)〈𝐷, 𝐸〉 ↔ ∃𝑢 ∈ 𝐴 (𝑢(𝑅 ⋉ 𝑆)〈𝐵, 𝐶〉 ∧ 𝑢(𝑅 ⋉ 𝑆)〈𝐷, 𝐸〉))) | |
| 7 | 4, 5, 6 | mp2an 704 | . . 3 ⊢ (〈𝐵, 𝐶〉 ≀ ((𝑅 ⋉ 𝑆) ↾ 𝐴)〈𝐷, 𝐸〉 ↔ ∃𝑢 ∈ 𝐴 (𝑢(𝑅 ⋉ 𝑆)〈𝐵, 𝐶〉 ∧ 𝑢(𝑅 ⋉ 𝑆)〈𝐷, 𝐸〉)) |
| 8 | brxrn 38982 | . . . . . . 7 ⊢ ((𝑢 ∈ V ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (𝑢(𝑅 ⋉ 𝑆)〈𝐵, 𝐶〉 ↔ (𝑢𝑅𝐵 ∧ 𝑢𝑆𝐶))) | |
| 9 | 8 | el3v1 38829 | . . . . . 6 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (𝑢(𝑅 ⋉ 𝑆)〈𝐵, 𝐶〉 ↔ (𝑢𝑅𝐵 ∧ 𝑢𝑆𝐶))) |
| 10 | brxrn 38982 | . . . . . . 7 ⊢ ((𝑢 ∈ V ∧ 𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → (𝑢(𝑅 ⋉ 𝑆)〈𝐷, 𝐸〉 ↔ (𝑢𝑅𝐷 ∧ 𝑢𝑆𝐸))) | |
| 11 | 10 | el3v1 38829 | . . . . . 6 ⊢ ((𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → (𝑢(𝑅 ⋉ 𝑆)〈𝐷, 𝐸〉 ↔ (𝑢𝑅𝐷 ∧ 𝑢𝑆𝐸))) |
| 12 | 9, 11 | bi2anan9 649 | . . . . 5 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) ∧ (𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌)) → ((𝑢(𝑅 ⋉ 𝑆)〈𝐵, 𝐶〉 ∧ 𝑢(𝑅 ⋉ 𝑆)〈𝐷, 𝐸〉) ↔ ((𝑢𝑅𝐵 ∧ 𝑢𝑆𝐶) ∧ (𝑢𝑅𝐷 ∧ 𝑢𝑆𝐸)))) |
| 13 | an2anr 647 | . . . . 5 ⊢ (((𝑢𝑅𝐵 ∧ 𝑢𝑆𝐶) ∧ (𝑢𝑅𝐷 ∧ 𝑢𝑆𝐸)) ↔ ((𝑢𝑆𝐶 ∧ 𝑢𝑅𝐵) ∧ (𝑢𝑆𝐸 ∧ 𝑢𝑅𝐷))) | |
| 14 | 12, 13 | bitrdi 290 | . . . 4 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) ∧ (𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌)) → ((𝑢(𝑅 ⋉ 𝑆)〈𝐵, 𝐶〉 ∧ 𝑢(𝑅 ⋉ 𝑆)〈𝐷, 𝐸〉) ↔ ((𝑢𝑆𝐶 ∧ 𝑢𝑅𝐵) ∧ (𝑢𝑆𝐸 ∧ 𝑢𝑅𝐷)))) |
| 15 | 14 | rexbidv 3196 | . . 3 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) ∧ (𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌)) → (∃𝑢 ∈ 𝐴 (𝑢(𝑅 ⋉ 𝑆)〈𝐵, 𝐶〉 ∧ 𝑢(𝑅 ⋉ 𝑆)〈𝐷, 𝐸〉) ↔ ∃𝑢 ∈ 𝐴 ((𝑢𝑆𝐶 ∧ 𝑢𝑅𝐵) ∧ (𝑢𝑆𝐸 ∧ 𝑢𝑅𝐷)))) |
| 16 | 7, 15 | bitrid 286 | . 2 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) ∧ (𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌)) → (〈𝐵, 𝐶〉 ≀ ((𝑅 ⋉ 𝑆) ↾ 𝐴)〈𝐷, 𝐸〉 ↔ ∃𝑢 ∈ 𝐴 ((𝑢𝑆𝐶 ∧ 𝑢𝑅𝐵) ∧ (𝑢𝑆𝐸 ∧ 𝑢𝑅𝐷)))) |
| 17 | 3, 16 | bitr3id 288 | 1 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) ∧ (𝐷 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌)) → (〈𝐵, 𝐶〉 ≀ (𝑅 ⋉ (𝑆 ↾ 𝐴))〈𝐷, 𝐸〉 ↔ ∃𝑢 ∈ 𝐴 ((𝑢𝑆𝐶 ∧ 𝑢𝑅𝐵) ∧ (𝑢𝑆𝐸 ∧ 𝑢𝑅𝐷)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∈ wcel 2150 ∃wrex 3096 Vcvv 3462 〈cop 4600 class class class wbr 5114 ↾ cres 5667 ⋉ cxrn 38773 ≀ ccoss 38782 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2199 ax-12 2220 ax-ext 2742 ax-sep 5262 ax-nul 5274 ax-pr 5408 ax-un 7736 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2099 df-mo 2574 df-eu 2604 df-clab 2749 df-cleq 2762 df-clel 2845 df-nfc 2919 df-ne 2966 df-ral 3087 df-rex 3097 df-rab 3424 df-v 3464 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-br 5115 df-opab 5179 df-mpt 5198 df-id 5560 df-xp 5671 df-rel 5672 df-cnv 5673 df-co 5674 df-dm 5675 df-rn 5676 df-res 5677 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-fo 6546 df-fv 6548 df-1st 7989 df-2nd 7990 df-xrn 38979 df-coss 39100 |
| This theorem is referenced by: br1cossxrnidres 39140 br1cossxrncnvepres 39141 br1cossxrncnvssrres 39187 |
| Copyright terms: Public domain | W3C validator |