| 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 7932. (Contributed by NM, 9-Oct-2004.) |
| Ref | Expression |
|---|---|
| elxp6 | ⊢ (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = 〈(1st ‘𝐴), (2nd ‘𝐴)〉 ∧ ((1st ‘𝐴) ∈ 𝐵 ∧ (2nd ‘𝐴) ∈ 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elxp4 7932 | . 2 ⊢ (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = 〈∪ dom {𝐴}, ∪ ran {𝐴}〉 ∧ (∪ dom {𝐴} ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶))) | |
| 2 | 1stval 8001 | . . . . 5 ⊢ (1st ‘𝐴) = ∪ dom {𝐴} | |
| 3 | 2ndval 8002 | . . . . 5 ⊢ (2nd ‘𝐴) = ∪ ran {𝐴} | |
| 4 | 2, 3 | opeq12i 4838 | . . . 4 ⊢ 〈(1st ‘𝐴), (2nd ‘𝐴)〉 = 〈∪ dom {𝐴}, ∪ ran {𝐴}〉 |
| 5 | 4 | eqeq2i 2774 | . . 3 ⊢ (𝐴 = 〈(1st ‘𝐴), (2nd ‘𝐴)〉 ↔ 𝐴 = 〈∪ dom {𝐴}, ∪ ran {𝐴}〉) |
| 6 | 2 | eleq1i 2852 | . . . 4 ⊢ ((1st ‘𝐴) ∈ 𝐵 ↔ ∪ dom {𝐴} ∈ 𝐵) |
| 7 | 3 | eleq1i 2852 | . . . 4 ⊢ ((2nd ‘𝐴) ∈ 𝐶 ↔ ∪ ran {𝐴} ∈ 𝐶) |
| 8 | 6, 7 | anbi12i 640 | . . 3 ⊢ (((1st ‘𝐴) ∈ 𝐵 ∧ (2nd ‘𝐴) ∈ 𝐶) ↔ (∪ dom {𝐴} ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶)) |
| 9 | 5, 8 | anbi12i 640 | . 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 |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 {csn 4584 〈cop 4590 ∪ cuni 4867 × cxp 5649 dom cdm 5651 ran crn 5652 ‘cfv 6537 1st c1st 7997 2nd c2nd 7998 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pr 5391 ax-un 7749 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-iota 6493 df-fun 6539 df-fv 6545 df-1st 7999 df-2nd 8000 |
| This theorem is used by: elxp7 8034 eqopi 8035 1st2nd2 8038 eldju2ndl 9998 eldju2ndr 9999 r0weon 10084 qredeu 16826 qnumdencl 16908 setsstruct2 17345 tx1cn 23921 tx2cn 23922 txhaus 23959 psmetxrge0 24625 xppreima 33232 ofpreima2 33253 smatrcl 34421 1stmbfm 34885 2ndmbfm 34886 oddpwdcv 34980 prproropf1olem0 48553 |
| Copyright terms: Public domain | W3C validator |