| 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 7945. (Contributed by NM, 9-Oct-2004.) |
| Ref | Expression |
|---|---|
| elxp6 | ⊢ (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = 〈(1st ‘𝐴), (2nd ‘𝐴)〉 ∧ ((1st ‘𝐴) ∈ 𝐵 ∧ (2nd ‘𝐴) ∈ 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elxp4 7945 | . 2 ⊢ (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = 〈∪ dom {𝐴}, ∪ ran {𝐴}〉 ∧ (∪ dom {𝐴} ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶))) | |
| 2 | 1stval 8017 | . . . . 5 ⊢ (1st ‘𝐴) = ∪ dom {𝐴} | |
| 3 | 2ndval 8018 | . . . . 5 ⊢ (2nd ‘𝐴) = ∪ ran {𝐴} | |
| 4 | 2, 3 | opeq12i 4877 | . . . 4 ⊢ 〈(1st ‘𝐴), (2nd ‘𝐴)〉 = 〈∪ dom {𝐴}, ∪ ran {𝐴}〉 |
| 5 | 4 | eqeq2i 2749 | . . 3 ⊢ (𝐴 = 〈(1st ‘𝐴), (2nd ‘𝐴)〉 ↔ 𝐴 = 〈∪ dom {𝐴}, ∪ ran {𝐴}〉) |
| 6 | 2 | eleq1i 2831 | . . . 4 ⊢ ((1st ‘𝐴) ∈ 𝐵 ↔ ∪ dom {𝐴} ∈ 𝐵) |
| 7 | 3 | eleq1i 2831 | . . . 4 ⊢ ((2nd ‘𝐴) ∈ 𝐶 ↔ ∪ ran {𝐴} ∈ 𝐶) |
| 8 | 6, 7 | anbi12i 628 | . . 3 ⊢ (((1st ‘𝐴) ∈ 𝐵 ∧ (2nd ‘𝐴) ∈ 𝐶) ↔ (∪ dom {𝐴} ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶)) |
| 9 | 5, 8 | anbi12i 628 | . 2 ⊢ ((𝐴 = 〈(1st ‘𝐴), (2nd ‘𝐴)〉 ∧ ((1st ‘𝐴) ∈ 𝐵 ∧ (2nd ‘𝐴) ∈ 𝐶)) ↔ (𝐴 = 〈∪ dom {𝐴}, ∪ ran {𝐴}〉 ∧ (∪ dom {𝐴} ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶))) |
| 10 | 1, 9 | bitr4i 278 | 1 ⊢ (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = 〈(1st ‘𝐴), (2nd ‘𝐴)〉 ∧ ((1st ‘𝐴) ∈ 𝐵 ∧ (2nd ‘𝐴) ∈ 𝐶))) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 = wceq 1539 ∈ wcel 2107 {csn 4625 〈cop 4631 ∪ cuni 4906 × cxp 5682 dom cdm 5684 ran crn 5685 ‘cfv 6560 1st c1st 8013 2nd c2nd 8014 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2707 ax-sep 5295 ax-nul 5305 ax-pr 5431 ax-un 7756 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2728 df-clel 2815 df-nfc 2891 df-ral 3061 df-rex 3070 df-rab 3436 df-v 3481 df-dif 3953 df-un 3955 df-in 3957 df-ss 3967 df-nul 4333 df-if 4525 df-sn 4626 df-pr 4628 df-op 4632 df-uni 4907 df-br 5143 df-opab 5205 df-mpt 5225 df-id 5577 df-xp 5690 df-rel 5691 df-cnv 5692 df-co 5693 df-dm 5694 df-rn 5695 df-iota 6513 df-fun 6562 df-fv 6568 df-1st 8015 df-2nd 8016 |
| This theorem is referenced by: elxp7 8050 eqopi 8051 1st2nd2 8054 eldju2ndl 9965 eldju2ndr 9966 r0weon 10053 qredeu 16696 qnumdencl 16777 setsstruct2 17212 tx1cn 23618 tx2cn 23619 txhaus 23656 psmetxrge0 24324 xppreima 32656 ofpreima2 32677 smatrcl 33796 1stmbfm 34263 2ndmbfm 34264 oddpwdcv 34358 prproropf1olem0 47494 |
| Copyright terms: Public domain | W3C validator |