Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > elxp7 | Structured version Visualization version GIF version |
Description: Membership in a Cartesian product. This version requires no quantifiers or dummy variables. See also elxp4 7629. (Contributed by NM, 19-Aug-2006.) |
Ref | Expression |
---|---|
elxp7 | ⊢ (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 ∈ (V × V) ∧ ((1st ‘𝐴) ∈ 𝐵 ∧ (2nd ‘𝐴) ∈ 𝐶))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elxp6 7725 | . 2 ⊢ (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = 〈(1st ‘𝐴), (2nd ‘𝐴)〉 ∧ ((1st ‘𝐴) ∈ 𝐵 ∧ (2nd ‘𝐴) ∈ 𝐶))) | |
2 | fvex 6685 | . . . . 5 ⊢ (1st ‘𝐴) ∈ V | |
3 | fvex 6685 | . . . . 5 ⊢ (2nd ‘𝐴) ∈ V | |
4 | 2, 3 | pm3.2i 473 | . . . 4 ⊢ ((1st ‘𝐴) ∈ V ∧ (2nd ‘𝐴) ∈ V) |
5 | elxp6 7725 | . . . 4 ⊢ (𝐴 ∈ (V × V) ↔ (𝐴 = 〈(1st ‘𝐴), (2nd ‘𝐴)〉 ∧ ((1st ‘𝐴) ∈ V ∧ (2nd ‘𝐴) ∈ V))) | |
6 | 4, 5 | mpbiran2 708 | . . 3 ⊢ (𝐴 ∈ (V × V) ↔ 𝐴 = 〈(1st ‘𝐴), (2nd ‘𝐴)〉) |
7 | 6 | anbi1i 625 | . 2 ⊢ ((𝐴 ∈ (V × V) ∧ ((1st ‘𝐴) ∈ 𝐵 ∧ (2nd ‘𝐴) ∈ 𝐶)) ↔ (𝐴 = 〈(1st ‘𝐴), (2nd ‘𝐴)〉 ∧ ((1st ‘𝐴) ∈ 𝐵 ∧ (2nd ‘𝐴) ∈ 𝐶))) |
8 | 1, 7 | bitr4i 280 | 1 ⊢ (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 ∈ (V × V) ∧ ((1st ‘𝐴) ∈ 𝐵 ∧ (2nd ‘𝐴) ∈ 𝐶))) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 ∧ wa 398 = wceq 1537 ∈ wcel 2114 Vcvv 3496 〈cop 4575 × cxp 5555 ‘cfv 6357 1st c1st 7689 2nd c2nd 7690 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ral 3145 df-rex 3146 df-rab 3149 df-v 3498 df-sbc 3775 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 df-br 5069 df-opab 5131 df-mpt 5149 df-id 5462 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-iota 6316 df-fun 6359 df-fv 6365 df-1st 7691 df-2nd 7692 |
This theorem is referenced by: xp2 7728 unielxp 7729 1stconst 7797 2ndconst 7798 fparlem1 7809 fparlem2 7810 infxpenlem 9441 1stpreimas 30443 1stpreima 30444 2ndpreima 30445 f1od2 30459 xpinpreima2 31152 tpr2rico 31157 sxbrsigalem0 31531 dya2iocnrect 31541 elxp8 34654 pellex 39439 elpglem3 44822 |
Copyright terms: Public domain | W3C validator |