Mathbox for Scott Fenton |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > brtxp2 | Structured version Visualization version GIF version |
Description: The binary relation over a tail cross when the second argument is not an ordered pair. (Contributed by Scott Fenton, 14-Apr-2014.) (Revised by Mario Carneiro, 3-May-2015.) |
Ref | Expression |
---|---|
brtxp2.1 | ⊢ 𝐴 ∈ V |
Ref | Expression |
---|---|
brtxp2 | ⊢ (𝐴(𝑅 ⊗ 𝑆)𝐵 ↔ ∃𝑥∃𝑦(𝐵 = 〈𝑥, 𝑦〉 ∧ 𝐴𝑅𝑥 ∧ 𝐴𝑆𝑦)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | txpss3v 33950 | . . . . . . 7 ⊢ (𝑅 ⊗ 𝑆) ⊆ (V × (V × V)) | |
2 | 1 | brel 5631 | . . . . . 6 ⊢ (𝐴(𝑅 ⊗ 𝑆)𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ (V × V))) |
3 | 2 | simprd 499 | . . . . 5 ⊢ (𝐴(𝑅 ⊗ 𝑆)𝐵 → 𝐵 ∈ (V × V)) |
4 | elvv 5640 | . . . . 5 ⊢ (𝐵 ∈ (V × V) ↔ ∃𝑥∃𝑦 𝐵 = 〈𝑥, 𝑦〉) | |
5 | 3, 4 | sylib 221 | . . . 4 ⊢ (𝐴(𝑅 ⊗ 𝑆)𝐵 → ∃𝑥∃𝑦 𝐵 = 〈𝑥, 𝑦〉) |
6 | 5 | pm4.71ri 564 | . . 3 ⊢ (𝐴(𝑅 ⊗ 𝑆)𝐵 ↔ (∃𝑥∃𝑦 𝐵 = 〈𝑥, 𝑦〉 ∧ 𝐴(𝑅 ⊗ 𝑆)𝐵)) |
7 | 19.41vv 1959 | . . 3 ⊢ (∃𝑥∃𝑦(𝐵 = 〈𝑥, 𝑦〉 ∧ 𝐴(𝑅 ⊗ 𝑆)𝐵) ↔ (∃𝑥∃𝑦 𝐵 = 〈𝑥, 𝑦〉 ∧ 𝐴(𝑅 ⊗ 𝑆)𝐵)) | |
8 | 6, 7 | bitr4i 281 | . 2 ⊢ (𝐴(𝑅 ⊗ 𝑆)𝐵 ↔ ∃𝑥∃𝑦(𝐵 = 〈𝑥, 𝑦〉 ∧ 𝐴(𝑅 ⊗ 𝑆)𝐵)) |
9 | breq2 5073 | . . . 4 ⊢ (𝐵 = 〈𝑥, 𝑦〉 → (𝐴(𝑅 ⊗ 𝑆)𝐵 ↔ 𝐴(𝑅 ⊗ 𝑆)〈𝑥, 𝑦〉)) | |
10 | 9 | pm5.32i 578 | . . 3 ⊢ ((𝐵 = 〈𝑥, 𝑦〉 ∧ 𝐴(𝑅 ⊗ 𝑆)𝐵) ↔ (𝐵 = 〈𝑥, 𝑦〉 ∧ 𝐴(𝑅 ⊗ 𝑆)〈𝑥, 𝑦〉)) |
11 | 10 | 2exbii 1856 | . 2 ⊢ (∃𝑥∃𝑦(𝐵 = 〈𝑥, 𝑦〉 ∧ 𝐴(𝑅 ⊗ 𝑆)𝐵) ↔ ∃𝑥∃𝑦(𝐵 = 〈𝑥, 𝑦〉 ∧ 𝐴(𝑅 ⊗ 𝑆)〈𝑥, 𝑦〉)) |
12 | brtxp2.1 | . . . . . 6 ⊢ 𝐴 ∈ V | |
13 | vex 3427 | . . . . . 6 ⊢ 𝑥 ∈ V | |
14 | vex 3427 | . . . . . 6 ⊢ 𝑦 ∈ V | |
15 | 12, 13, 14 | brtxp 33952 | . . . . 5 ⊢ (𝐴(𝑅 ⊗ 𝑆)〈𝑥, 𝑦〉 ↔ (𝐴𝑅𝑥 ∧ 𝐴𝑆𝑦)) |
16 | 15 | anbi2i 626 | . . . 4 ⊢ ((𝐵 = 〈𝑥, 𝑦〉 ∧ 𝐴(𝑅 ⊗ 𝑆)〈𝑥, 𝑦〉) ↔ (𝐵 = 〈𝑥, 𝑦〉 ∧ (𝐴𝑅𝑥 ∧ 𝐴𝑆𝑦))) |
17 | 3anass 1097 | . . . 4 ⊢ ((𝐵 = 〈𝑥, 𝑦〉 ∧ 𝐴𝑅𝑥 ∧ 𝐴𝑆𝑦) ↔ (𝐵 = 〈𝑥, 𝑦〉 ∧ (𝐴𝑅𝑥 ∧ 𝐴𝑆𝑦))) | |
18 | 16, 17 | bitr4i 281 | . . 3 ⊢ ((𝐵 = 〈𝑥, 𝑦〉 ∧ 𝐴(𝑅 ⊗ 𝑆)〈𝑥, 𝑦〉) ↔ (𝐵 = 〈𝑥, 𝑦〉 ∧ 𝐴𝑅𝑥 ∧ 𝐴𝑆𝑦)) |
19 | 18 | 2exbii 1856 | . 2 ⊢ (∃𝑥∃𝑦(𝐵 = 〈𝑥, 𝑦〉 ∧ 𝐴(𝑅 ⊗ 𝑆)〈𝑥, 𝑦〉) ↔ ∃𝑥∃𝑦(𝐵 = 〈𝑥, 𝑦〉 ∧ 𝐴𝑅𝑥 ∧ 𝐴𝑆𝑦)) |
20 | 8, 11, 19 | 3bitri 300 | 1 ⊢ (𝐴(𝑅 ⊗ 𝑆)𝐵 ↔ ∃𝑥∃𝑦(𝐵 = 〈𝑥, 𝑦〉 ∧ 𝐴𝑅𝑥 ∧ 𝐴𝑆𝑦)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 209 ∧ wa 399 ∧ w3a 1089 = wceq 1543 ∃wex 1787 ∈ wcel 2112 Vcvv 3423 〈cop 4563 class class class wbr 5069 × cxp 5566 ⊗ ctxp 33902 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2160 ax-12 2177 ax-ext 2710 ax-sep 5208 ax-nul 5215 ax-pr 5338 ax-un 7544 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2073 df-mo 2541 df-eu 2570 df-clab 2717 df-cleq 2731 df-clel 2818 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3425 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4456 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4836 df-br 5070 df-opab 5132 df-mpt 5152 df-id 5471 df-xp 5574 df-rel 5575 df-cnv 5576 df-co 5577 df-dm 5578 df-rn 5579 df-res 5580 df-iota 6358 df-fun 6402 df-fn 6403 df-f 6404 df-fo 6406 df-fv 6408 df-1st 7782 df-2nd 7783 df-txp 33926 |
This theorem is referenced by: brsuccf 34013 brrestrict 34021 |
Copyright terms: Public domain | W3C validator |