| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elxp6 | Structured version Visualization version GIF version | ||
| Description: Membership in a Cartesian product. This version requires no quantifiers or dummy variables. See also elxp4 7915. (Contributed by NM, 9-Oct-2004.) |
| Ref | Expression |
|---|---|
| elxp6 | ⊢ (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = 〈(1st ‘𝐴), (2nd ‘𝐴)〉 ∧ ((1st ‘𝐴) ∈ 𝐵 ∧ (2nd ‘𝐴) ∈ 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elxp4 7915 | . 2 ⊢ (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = 〈∪ dom {𝐴}, ∪ ran {𝐴}〉 ∧ (∪ dom {𝐴} ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶))) | |
| 2 | 1stval 7984 | . . . . 5 ⊢ (1st ‘𝐴) = ∪ dom {𝐴} | |
| 3 | 2ndval 7985 | . . . . 5 ⊢ (2nd ‘𝐴) = ∪ ran {𝐴} | |
| 4 | 2, 3 | opeq12i 4843 | . . . 4 ⊢ 〈(1st ‘𝐴), (2nd ‘𝐴)〉 = 〈∪ dom {𝐴}, ∪ ran {𝐴}〉 |
| 5 | 4 | eqeq2i 2776 | . . 3 ⊢ (𝐴 = 〈(1st ‘𝐴), (2nd ‘𝐴)〉 ↔ 𝐴 = 〈∪ dom {𝐴}, ∪ ran {𝐴}〉) |
| 6 | 2 | eleq1i 2854 | . . . 4 ⊢ ((1st ‘𝐴) ∈ 𝐵 ↔ ∪ dom {𝐴} ∈ 𝐵) |
| 7 | 3 | eleq1i 2854 | . . . 4 ⊢ ((2nd ‘𝐴) ∈ 𝐶 ↔ ∪ ran {𝐴} ∈ 𝐶) |
| 8 | 6, 7 | anbi12i 639 | . . 3 ⊢ (((1st ‘𝐴) ∈ 𝐵 ∧ (2nd ‘𝐴) ∈ 𝐶) ↔ (∪ dom {𝐴} ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶)) |
| 9 | 5, 8 | anbi12i 639 | . 2 ⊢ ((𝐴 = 〈(1st ‘𝐴), (2nd ‘𝐴)〉 ∧ ((1st ‘𝐴) ∈ 𝐵 ∧ (2nd ‘𝐴) ∈ 𝐶)) ↔ (𝐴 = 〈∪ dom {𝐴}, ∪ ran {𝐴}〉 ∧ (∪ dom {𝐴} ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶))) |
| 10 | 1, 9 | bitr4i 281 | 1 ⊢ (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = 〈(1st ‘𝐴), (2nd ‘𝐴)〉 ∧ ((1st ‘𝐴) ∈ 𝐵 ∧ (2nd ‘𝐴) ∈ 𝐶))) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 ∧ wa 400 = wceq 1570 ∈ wcel 2143 {csn 4589 〈cop 4595 ∪ cuni 4872 × cxp 5659 dom cdm 5661 ran crn 5662 ‘cfv 6536 1st c1st 7980 2nd c2nd 7981 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-opab 5174 df-mpt 5193 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-iota 6492 df-fun 6538 df-fv 6544 df-1st 7982 df-2nd 7983 |
| This theorem is referenced by: elxp7 8017 eqopi 8018 1st2nd2 8021 eldju2ndl 9906 eldju2ndr 9907 r0weon 9992 qredeu 16711 qnumdencl 16793 setsstruct2 17229 tx1cn 23766 tx2cn 23767 txhaus 23804 psmetxrge0 24470 xppreima 32990 ofpreima2 33011 smatrcl 34186 1stmbfm 34650 2ndmbfm 34651 oddpwdcv 34745 prproropf1olem0 48251 |
| Copyright terms: Public domain | W3C validator |