| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > brxrn2 | Structured version Visualization version GIF version | ||
| Description: A characterization of the range Cartesian product. (Contributed by Peter Mazsa, 14-Oct-2020.) |
| Ref | Expression |
|---|---|
| brxrn2 | ⊢ (𝐴 ∈ 𝑉 → (𝐴(𝑅 ⋉ 𝑆)𝐵 ↔ ∃𝑥∃𝑦(𝐵 = 〈𝑥, 𝑦〉 ∧ 𝐴𝑅𝑥 ∧ 𝐴𝑆𝑦))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | xrnss3v 39581 | . . . . . . 7 ⊢ (𝑅 ⋉ 𝑆) ⊆ (V × (V × V)) | |
| 2 | 1 | brel 5722 | . . . . . 6 ⊢ (𝐴(𝑅 ⋉ 𝑆)𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ (V × V))) |
| 3 | 2 | simprd 501 | . . . . 5 ⊢ (𝐴(𝑅 ⋉ 𝑆)𝐵 → 𝐵 ∈ (V × V)) |
| 4 | elvv 5732 | . . . . 5 ⊢ (𝐵 ∈ (V × V) ↔ ∃𝑥∃𝑦 𝐵 = 〈𝑥, 𝑦〉) | |
| 5 | 3, 4 | sylib 221 | . . . 4 ⊢ (𝐴(𝑅 ⋉ 𝑆)𝐵 → ∃𝑥∃𝑦 𝐵 = 〈𝑥, 𝑦〉) |
| 6 | 5 | pm4.71ri 570 | . . 3 ⊢ (𝐴(𝑅 ⋉ 𝑆)𝐵 ↔ (∃𝑥∃𝑦 𝐵 = 〈𝑥, 𝑦〉 ∧ 𝐴(𝑅 ⋉ 𝑆)𝐵)) |
| 7 | 19.41vv 1987 | . . 3 ⊢ (∃𝑥∃𝑦(𝐵 = 〈𝑥, 𝑦〉 ∧ 𝐴(𝑅 ⋉ 𝑆)𝐵) ↔ (∃𝑥∃𝑦 𝐵 = 〈𝑥, 𝑦〉 ∧ 𝐴(𝑅 ⋉ 𝑆)𝐵)) | |
| 8 | breq2 5111 | . . . . 5 ⊢ (𝐵 = 〈𝑥, 𝑦〉 → (𝐴(𝑅 ⋉ 𝑆)𝐵 ↔ 𝐴(𝑅 ⋉ 𝑆)〈𝑥, 𝑦〉)) | |
| 9 | 8 | pm5.32i 585 | . . . 4 ⊢ ((𝐵 = 〈𝑥, 𝑦〉 ∧ 𝐴(𝑅 ⋉ 𝑆)𝐵) ↔ (𝐵 = 〈𝑥, 𝑦〉 ∧ 𝐴(𝑅 ⋉ 𝑆)〈𝑥, 𝑦〉)) |
| 10 | 9 | 2exbii 1884 | . . 3 ⊢ (∃𝑥∃𝑦(𝐵 = 〈𝑥, 𝑦〉 ∧ 𝐴(𝑅 ⋉ 𝑆)𝐵) ↔ ∃𝑥∃𝑦(𝐵 = 〈𝑥, 𝑦〉 ∧ 𝐴(𝑅 ⋉ 𝑆)〈𝑥, 𝑦〉)) |
| 11 | 6, 7, 10 | 3bitr2i 302 | . 2 ⊢ (𝐴(𝑅 ⋉ 𝑆)𝐵 ↔ ∃𝑥∃𝑦(𝐵 = 〈𝑥, 𝑦〉 ∧ 𝐴(𝑅 ⋉ 𝑆)〈𝑥, 𝑦〉)) |
| 12 | brxrn 39583 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ V ∧ 𝑦 ∈ V) → (𝐴(𝑅 ⋉ 𝑆)〈𝑥, 𝑦〉 ↔ (𝐴𝑅𝑥 ∧ 𝐴𝑆𝑦))) | |
| 13 | 12 | el3v23 39434 | . . . . 5 ⊢ (𝐴 ∈ 𝑉 → (𝐴(𝑅 ⋉ 𝑆)〈𝑥, 𝑦〉 ↔ (𝐴𝑅𝑥 ∧ 𝐴𝑆𝑦))) |
| 14 | 13 | anbi2d 642 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → ((𝐵 = 〈𝑥, 𝑦〉 ∧ 𝐴(𝑅 ⋉ 𝑆)〈𝑥, 𝑦〉) ↔ (𝐵 = 〈𝑥, 𝑦〉 ∧ (𝐴𝑅𝑥 ∧ 𝐴𝑆𝑦)))) |
| 15 | 3anass 1112 | . . . 4 ⊢ ((𝐵 = 〈𝑥, 𝑦〉 ∧ 𝐴𝑅𝑥 ∧ 𝐴𝑆𝑦) ↔ (𝐵 = 〈𝑥, 𝑦〉 ∧ (𝐴𝑅𝑥 ∧ 𝐴𝑆𝑦))) | |
| 16 | 14, 15 | bitr4di 292 | . . 3 ⊢ (𝐴 ∈ 𝑉 → ((𝐵 = 〈𝑥, 𝑦〉 ∧ 𝐴(𝑅 ⋉ 𝑆)〈𝑥, 𝑦〉) ↔ (𝐵 = 〈𝑥, 𝑦〉 ∧ 𝐴𝑅𝑥 ∧ 𝐴𝑆𝑦))) |
| 17 | 16 | 2exbidv 1961 | . 2 ⊢ (𝐴 ∈ 𝑉 → (∃𝑥∃𝑦(𝐵 = 〈𝑥, 𝑦〉 ∧ 𝐴(𝑅 ⋉ 𝑆)〈𝑥, 𝑦〉) ↔ ∃𝑥∃𝑦(𝐵 = 〈𝑥, 𝑦〉 ∧ 𝐴𝑅𝑥 ∧ 𝐴𝑆𝑦))) |
| 18 | 11, 17 | bitrid 286 | 1 ⊢ (𝐴 ∈ 𝑉 → (𝐴(𝑅 ⋉ 𝑆)𝐵 ↔ ∃𝑥∃𝑦(𝐵 = 〈𝑥, 𝑦〉 ∧ 𝐴𝑅𝑥 ∧ 𝐴𝑆𝑦))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1104 = wceq 1572 ∃wex 1814 ∈ wcel 2150 Vcvv 3453 〈cop 4839 class class class wbr 5107 × cxp 5655 ⋉ cxrn 39374 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-sep 5254 ax-nul 5265 ax-pr 5397 ax-un 7782 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-ral 3084 df-rex 3094 df-rab 3416 df-v 3455 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-br 5108 df-opab 5173 df-mpt 5192 df-id 5552 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-fo 6571 df-fv 6573 df-1st 8034 df-2nd 8035 df-xrn 39580 |
| This theorem is used by: dfxrn2 39585 elecxrn 39605 inxpxrn 39618 br1cnvxrn2 39619 |
| Copyright terms: Public domain | W3C validator |