Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > dfxrn2 | Structured version Visualization version GIF version |
Description: Alternate definition of the range Cartesian product. (Contributed by Peter Mazsa, 20-Feb-2022.) |
Ref | Expression |
---|---|
dfxrn2 | ⊢ (𝑅 ⋉ 𝑆) = ◡{〈〈𝑥, 𝑦〉, 𝑢〉 ∣ (𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | xrnrel 36503 | . . 3 ⊢ Rel (𝑅 ⋉ 𝑆) | |
2 | dfrel4v 6093 | . . 3 ⊢ (Rel (𝑅 ⋉ 𝑆) ↔ (𝑅 ⋉ 𝑆) = {〈𝑢, 𝑧〉 ∣ 𝑢(𝑅 ⋉ 𝑆)𝑧}) | |
3 | 1, 2 | mpbi 229 | . 2 ⊢ (𝑅 ⋉ 𝑆) = {〈𝑢, 𝑧〉 ∣ 𝑢(𝑅 ⋉ 𝑆)𝑧} |
4 | breq2 5078 | . . 3 ⊢ (𝑧 = 〈𝑥, 𝑦〉 → (𝑢(𝑅 ⋉ 𝑆)𝑧 ↔ 𝑢(𝑅 ⋉ 𝑆)〈𝑥, 𝑦〉)) | |
5 | brxrn2 36505 | . . . . . 6 ⊢ (𝑢 ∈ V → (𝑢(𝑅 ⋉ 𝑆)𝑧 ↔ ∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦))) | |
6 | 5 | elv 3438 | . . . . 5 ⊢ (𝑢(𝑅 ⋉ 𝑆)𝑧 ↔ ∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)) |
7 | brxrn 36504 | . . . . . . . . 9 ⊢ ((𝑢 ∈ V ∧ 𝑥 ∈ V ∧ 𝑦 ∈ V) → (𝑢(𝑅 ⋉ 𝑆)〈𝑥, 𝑦〉 ↔ (𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦))) | |
8 | 7 | el3v 36371 | . . . . . . . 8 ⊢ (𝑢(𝑅 ⋉ 𝑆)〈𝑥, 𝑦〉 ↔ (𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)) |
9 | 8 | anbi2i 623 | . . . . . . 7 ⊢ ((𝑧 = 〈𝑥, 𝑦〉 ∧ 𝑢(𝑅 ⋉ 𝑆)〈𝑥, 𝑦〉) ↔ (𝑧 = 〈𝑥, 𝑦〉 ∧ (𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦))) |
10 | 3anass 1094 | . . . . . . 7 ⊢ ((𝑧 = 〈𝑥, 𝑦〉 ∧ 𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦) ↔ (𝑧 = 〈𝑥, 𝑦〉 ∧ (𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦))) | |
11 | 9, 10 | bitr4i 277 | . . . . . 6 ⊢ ((𝑧 = 〈𝑥, 𝑦〉 ∧ 𝑢(𝑅 ⋉ 𝑆)〈𝑥, 𝑦〉) ↔ (𝑧 = 〈𝑥, 𝑦〉 ∧ 𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)) |
12 | 11 | 2exbii 1851 | . . . . 5 ⊢ (∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝑢(𝑅 ⋉ 𝑆)〈𝑥, 𝑦〉) ↔ ∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)) |
13 | 4 | copsex2gb 5716 | . . . . 5 ⊢ (∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝑢(𝑅 ⋉ 𝑆)〈𝑥, 𝑦〉) ↔ (𝑧 ∈ (V × V) ∧ 𝑢(𝑅 ⋉ 𝑆)𝑧)) |
14 | 6, 12, 13 | 3bitr2i 299 | . . . 4 ⊢ (𝑢(𝑅 ⋉ 𝑆)𝑧 ↔ (𝑧 ∈ (V × V) ∧ 𝑢(𝑅 ⋉ 𝑆)𝑧)) |
15 | 14 | simplbi 498 | . . 3 ⊢ (𝑢(𝑅 ⋉ 𝑆)𝑧 → 𝑧 ∈ (V × V)) |
16 | 4, 15 | cnvoprab 7900 | . 2 ⊢ ◡{〈〈𝑥, 𝑦〉, 𝑢〉 ∣ 𝑢(𝑅 ⋉ 𝑆)〈𝑥, 𝑦〉} = {〈𝑢, 𝑧〉 ∣ 𝑢(𝑅 ⋉ 𝑆)𝑧} |
17 | 8 | oprabbii 7342 | . . 3 ⊢ {〈〈𝑥, 𝑦〉, 𝑢〉 ∣ 𝑢(𝑅 ⋉ 𝑆)〈𝑥, 𝑦〉} = {〈〈𝑥, 𝑦〉, 𝑢〉 ∣ (𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)} |
18 | 17 | cnveqi 5783 | . 2 ⊢ ◡{〈〈𝑥, 𝑦〉, 𝑢〉 ∣ 𝑢(𝑅 ⋉ 𝑆)〈𝑥, 𝑦〉} = ◡{〈〈𝑥, 𝑦〉, 𝑢〉 ∣ (𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)} |
19 | 3, 16, 18 | 3eqtr2i 2772 | 1 ⊢ (𝑅 ⋉ 𝑆) = ◡{〈〈𝑥, 𝑦〉, 𝑢〉 ∣ (𝑢𝑅𝑥 ∧ 𝑢𝑆𝑦)} |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∧ wa 396 ∧ w3a 1086 = wceq 1539 ∃wex 1782 ∈ wcel 2106 Vcvv 3432 〈cop 4567 class class class wbr 5074 {copab 5136 × cxp 5587 ◡ccnv 5588 Rel wrel 5594 {coprab 7276 ⋉ cxrn 36332 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 ax-un 7588 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-sbc 3717 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5075 df-opab 5137 df-mpt 5158 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-fo 6439 df-fv 6441 df-oprab 7279 df-1st 7831 df-2nd 7832 df-xrn 36501 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |