| Mathbox for Scott Fenton |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > brpprod3b | Structured version Visualization version GIF version | ||
| Description: Condition for parallel product when the first argument is not an ordered pair. (Contributed by Scott Fenton, 3-May-2014.) |
| Ref | Expression |
|---|---|
| brpprod3.1 | ⊢ 𝑋 ∈ V |
| brpprod3.2 | ⊢ 𝑌 ∈ V |
| brpprod3.3 | ⊢ 𝑍 ∈ V |
| Ref | Expression |
|---|---|
| brpprod3b | ⊢ (𝑋pprod(𝑅, 𝑆)〈𝑌, 𝑍〉 ↔ ∃𝑧∃𝑤(𝑋 = 〈𝑧, 𝑤〉 ∧ 𝑧𝑅𝑌 ∧ 𝑤𝑆𝑍)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pprodcnveq 36645 | . . 3 ⊢ pprod(𝑅, 𝑆) = ◡pprod(◡𝑅, ◡𝑆) | |
| 2 | 1 | breqi 5108 | . 2 ⊢ (𝑋pprod(𝑅, 𝑆)〈𝑌, 𝑍〉 ↔ 𝑋◡pprod(◡𝑅, ◡𝑆)〈𝑌, 𝑍〉) |
| 3 | brpprod3.1 | . . . . 5 ⊢ 𝑋 ∈ V | |
| 4 | opex 5431 | . . . . 5 ⊢ 〈𝑌, 𝑍〉 ∈ V | |
| 5 | 3, 4 | brcnv 5859 | . . . 4 ⊢ (𝑋◡pprod(◡𝑅, ◡𝑆)〈𝑌, 𝑍〉 ↔ 〈𝑌, 𝑍〉pprod(◡𝑅, ◡𝑆)𝑋) |
| 6 | brpprod3.2 | . . . . 5 ⊢ 𝑌 ∈ V | |
| 7 | brpprod3.3 | . . . . 5 ⊢ 𝑍 ∈ V | |
| 8 | 6, 7, 3 | brpprod3a 36648 | . . . 4 ⊢ (〈𝑌, 𝑍〉pprod(◡𝑅, ◡𝑆)𝑋 ↔ ∃𝑧∃𝑤(𝑋 = 〈𝑧, 𝑤〉 ∧ 𝑌◡𝑅𝑧 ∧ 𝑍◡𝑆𝑤)) |
| 9 | 5, 8 | bitri 278 | . . 3 ⊢ (𝑋◡pprod(◡𝑅, ◡𝑆)〈𝑌, 𝑍〉 ↔ ∃𝑧∃𝑤(𝑋 = 〈𝑧, 𝑤〉 ∧ 𝑌◡𝑅𝑧 ∧ 𝑍◡𝑆𝑤)) |
| 10 | biid 264 | . . . . 5 ⊢ (𝑋 = 〈𝑧, 𝑤〉 ↔ 𝑋 = 〈𝑧, 𝑤〉) | |
| 11 | vex 3454 | . . . . . 6 ⊢ 𝑧 ∈ V | |
| 12 | 6, 11 | brcnv 5859 | . . . . 5 ⊢ (𝑌◡𝑅𝑧 ↔ 𝑧𝑅𝑌) |
| 13 | vex 3454 | . . . . . 6 ⊢ 𝑤 ∈ V | |
| 14 | 7, 13 | brcnv 5859 | . . . . 5 ⊢ (𝑍◡𝑆𝑤 ↔ 𝑤𝑆𝑍) |
| 15 | 10, 12, 14 | 3anbi123i 1173 | . . . 4 ⊢ ((𝑋 = 〈𝑧, 𝑤〉 ∧ 𝑌◡𝑅𝑧 ∧ 𝑍◡𝑆𝑤) ↔ (𝑋 = 〈𝑧, 𝑤〉 ∧ 𝑧𝑅𝑌 ∧ 𝑤𝑆𝑍)) |
| 16 | 15 | 2exbii 1881 | . . 3 ⊢ (∃𝑧∃𝑤(𝑋 = 〈𝑧, 𝑤〉 ∧ 𝑌◡𝑅𝑧 ∧ 𝑍◡𝑆𝑤) ↔ ∃𝑧∃𝑤(𝑋 = 〈𝑧, 𝑤〉 ∧ 𝑧𝑅𝑌 ∧ 𝑤𝑆𝑍)) |
| 17 | 9, 16 | bitri 278 | . 2 ⊢ (𝑋◡pprod(◡𝑅, ◡𝑆)〈𝑌, 𝑍〉 ↔ ∃𝑧∃𝑤(𝑋 = 〈𝑧, 𝑤〉 ∧ 𝑧𝑅𝑌 ∧ 𝑤𝑆𝑍)) |
| 18 | 2, 17 | bitri 278 | 1 ⊢ (𝑋pprod(𝑅, 𝑆)〈𝑌, 𝑍〉 ↔ ∃𝑧∃𝑤(𝑋 = 〈𝑧, 𝑤〉 ∧ 𝑧𝑅𝑌 ∧ 𝑤𝑆𝑍)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ w3a 1103 = wceq 1569 ∃wex 1811 ∈ wcel 2144 Vcvv 3450 〈cop 4589 class class class wbr 5102 ◡ccnv 5649 pprodcpprod 36593 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5390 ax-un 7751 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-fo 6544 df-fv 6546 df-1st 8001 df-2nd 8002 df-txp 36616 df-pprod 36617 |
| This theorem is used by: brcart 36694 |
| Copyright terms: Public domain | W3C validator |