Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > elxp7 | GIF version |
Description: Membership in a cross product. This version requires no quantifiers or dummy variables. See also elxp4 4996. (Contributed by NM, 19-Aug-2006.) |
Ref | Expression |
---|---|
elxp7 | ⊢ (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 ∈ (V × V) ∧ ((1st ‘𝐴) ∈ 𝐵 ∧ (2nd ‘𝐴) ∈ 𝐶))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elex 2671 | . 2 ⊢ (𝐴 ∈ (𝐵 × 𝐶) → 𝐴 ∈ V) | |
2 | elex 2671 | . . 3 ⊢ (𝐴 ∈ (V × V) → 𝐴 ∈ V) | |
3 | 2 | adantr 274 | . 2 ⊢ ((𝐴 ∈ (V × V) ∧ ((1st ‘𝐴) ∈ 𝐵 ∧ (2nd ‘𝐴) ∈ 𝐶)) → 𝐴 ∈ V) |
4 | 1stexg 6033 | . . . . . . 7 ⊢ (𝐴 ∈ V → (1st ‘𝐴) ∈ V) | |
5 | 2ndexg 6034 | . . . . . . 7 ⊢ (𝐴 ∈ V → (2nd ‘𝐴) ∈ V) | |
6 | 4, 5 | jca 304 | . . . . . 6 ⊢ (𝐴 ∈ V → ((1st ‘𝐴) ∈ V ∧ (2nd ‘𝐴) ∈ V)) |
7 | 6 | biantrud 302 | . . . . 5 ⊢ (𝐴 ∈ V → (𝐴 = 〈(1st ‘𝐴), (2nd ‘𝐴)〉 ↔ (𝐴 = 〈(1st ‘𝐴), (2nd ‘𝐴)〉 ∧ ((1st ‘𝐴) ∈ V ∧ (2nd ‘𝐴) ∈ V)))) |
8 | elxp6 6035 | . . . . 5 ⊢ (𝐴 ∈ (V × V) ↔ (𝐴 = 〈(1st ‘𝐴), (2nd ‘𝐴)〉 ∧ ((1st ‘𝐴) ∈ V ∧ (2nd ‘𝐴) ∈ V))) | |
9 | 7, 8 | syl6rbbr 198 | . . . 4 ⊢ (𝐴 ∈ V → (𝐴 ∈ (V × V) ↔ 𝐴 = 〈(1st ‘𝐴), (2nd ‘𝐴)〉)) |
10 | 9 | anbi1d 460 | . . 3 ⊢ (𝐴 ∈ V → ((𝐴 ∈ (V × V) ∧ ((1st ‘𝐴) ∈ 𝐵 ∧ (2nd ‘𝐴) ∈ 𝐶)) ↔ (𝐴 = 〈(1st ‘𝐴), (2nd ‘𝐴)〉 ∧ ((1st ‘𝐴) ∈ 𝐵 ∧ (2nd ‘𝐴) ∈ 𝐶)))) |
11 | elxp6 6035 | . . 3 ⊢ (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = 〈(1st ‘𝐴), (2nd ‘𝐴)〉 ∧ ((1st ‘𝐴) ∈ 𝐵 ∧ (2nd ‘𝐴) ∈ 𝐶))) | |
12 | 10, 11 | syl6rbbr 198 | . 2 ⊢ (𝐴 ∈ V → (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 ∈ (V × V) ∧ ((1st ‘𝐴) ∈ 𝐵 ∧ (2nd ‘𝐴) ∈ 𝐶)))) |
13 | 1, 3, 12 | pm5.21nii 678 | 1 ⊢ (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 ∈ (V × V) ∧ ((1st ‘𝐴) ∈ 𝐵 ∧ (2nd ‘𝐴) ∈ 𝐶))) |
Colors of variables: wff set class |
Syntax hints: ∧ wa 103 ↔ wb 104 = wceq 1316 ∈ wcel 1465 Vcvv 2660 〈cop 3500 × cxp 4507 ‘cfv 5093 1st c1st 6004 2nd c2nd 6005 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 683 ax-5 1408 ax-7 1409 ax-gen 1410 ax-ie1 1454 ax-ie2 1455 ax-8 1467 ax-10 1468 ax-11 1469 ax-i12 1470 ax-bndl 1471 ax-4 1472 ax-13 1476 ax-14 1477 ax-17 1491 ax-i9 1495 ax-ial 1499 ax-i5r 1500 ax-ext 2099 ax-sep 4016 ax-pow 4068 ax-pr 4101 ax-un 4325 |
This theorem depends on definitions: df-bi 116 df-3an 949 df-tru 1319 df-nf 1422 df-sb 1721 df-eu 1980 df-mo 1981 df-clab 2104 df-cleq 2110 df-clel 2113 df-nfc 2247 df-ral 2398 df-rex 2399 df-v 2662 df-sbc 2883 df-un 3045 df-in 3047 df-ss 3054 df-pw 3482 df-sn 3503 df-pr 3504 df-op 3506 df-uni 3707 df-br 3900 df-opab 3960 df-mpt 3961 df-id 4185 df-xp 4515 df-rel 4516 df-cnv 4517 df-co 4518 df-dm 4519 df-rn 4520 df-iota 5058 df-fun 5095 df-fn 5096 df-f 5097 df-fo 5099 df-fv 5101 df-1st 6006 df-2nd 6007 |
This theorem is referenced by: xp2 6039 unielxp 6040 1stconst 6086 2ndconst 6087 f1od2 6100 |
Copyright terms: Public domain | W3C validator |