| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > op1steq | Structured version Visualization version GIF version | ||
| Description: Two ways of expressing that an element is the first member of an ordered pair. (Contributed by NM, 22-Sep-2013.) (Revised by Mario Carneiro, 23-Feb-2014.) |
| Ref | Expression |
|---|---|
| op1steq | ⊢ (𝐴 ∈ (𝑉 × 𝑊) → ((1st ‘𝐴) = 𝐵 ↔ ∃𝑥 𝐴 = 〈𝐵, 𝑥〉)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | xpss 5640 | . . 3 ⊢ (𝑉 × 𝑊) ⊆ (V × V) | |
| 2 | 1 | sseli 3929 | . 2 ⊢ (𝐴 ∈ (𝑉 × 𝑊) → 𝐴 ∈ (V × V)) |
| 3 | eqid 2736 | . . . . . 6 ⊢ (2nd ‘𝐴) = (2nd ‘𝐴) | |
| 4 | eqopi 7969 | . . . . . 6 ⊢ ((𝐴 ∈ (V × V) ∧ ((1st ‘𝐴) = 𝐵 ∧ (2nd ‘𝐴) = (2nd ‘𝐴))) → 𝐴 = 〈𝐵, (2nd ‘𝐴)〉) | |
| 5 | 3, 4 | mpanr2 704 | . . . . 5 ⊢ ((𝐴 ∈ (V × V) ∧ (1st ‘𝐴) = 𝐵) → 𝐴 = 〈𝐵, (2nd ‘𝐴)〉) |
| 6 | fvex 6847 | . . . . . 6 ⊢ (2nd ‘𝐴) ∈ V | |
| 7 | opeq2 4830 | . . . . . . 7 ⊢ (𝑥 = (2nd ‘𝐴) → 〈𝐵, 𝑥〉 = 〈𝐵, (2nd ‘𝐴)〉) | |
| 8 | 7 | eqeq2d 2747 | . . . . . 6 ⊢ (𝑥 = (2nd ‘𝐴) → (𝐴 = 〈𝐵, 𝑥〉 ↔ 𝐴 = 〈𝐵, (2nd ‘𝐴)〉)) |
| 9 | 6, 8 | spcev 3560 | . . . . 5 ⊢ (𝐴 = 〈𝐵, (2nd ‘𝐴)〉 → ∃𝑥 𝐴 = 〈𝐵, 𝑥〉) |
| 10 | 5, 9 | syl 17 | . . . 4 ⊢ ((𝐴 ∈ (V × V) ∧ (1st ‘𝐴) = 𝐵) → ∃𝑥 𝐴 = 〈𝐵, 𝑥〉) |
| 11 | 10 | ex 412 | . . 3 ⊢ (𝐴 ∈ (V × V) → ((1st ‘𝐴) = 𝐵 → ∃𝑥 𝐴 = 〈𝐵, 𝑥〉)) |
| 12 | eqop 7975 | . . . . 5 ⊢ (𝐴 ∈ (V × V) → (𝐴 = 〈𝐵, 𝑥〉 ↔ ((1st ‘𝐴) = 𝐵 ∧ (2nd ‘𝐴) = 𝑥))) | |
| 13 | simpl 482 | . . . . 5 ⊢ (((1st ‘𝐴) = 𝐵 ∧ (2nd ‘𝐴) = 𝑥) → (1st ‘𝐴) = 𝐵) | |
| 14 | 12, 13 | biimtrdi 253 | . . . 4 ⊢ (𝐴 ∈ (V × V) → (𝐴 = 〈𝐵, 𝑥〉 → (1st ‘𝐴) = 𝐵)) |
| 15 | 14 | exlimdv 1934 | . . 3 ⊢ (𝐴 ∈ (V × V) → (∃𝑥 𝐴 = 〈𝐵, 𝑥〉 → (1st ‘𝐴) = 𝐵)) |
| 16 | 11, 15 | impbid 212 | . 2 ⊢ (𝐴 ∈ (V × V) → ((1st ‘𝐴) = 𝐵 ↔ ∃𝑥 𝐴 = 〈𝐵, 𝑥〉)) |
| 17 | 2, 16 | syl 17 | 1 ⊢ (𝐴 ∈ (𝑉 × 𝑊) → ((1st ‘𝐴) = 𝐵 ↔ ∃𝑥 𝐴 = 〈𝐵, 𝑥〉)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∃wex 1780 ∈ wcel 2113 Vcvv 3440 〈cop 4586 × cxp 5622 ‘cfv 6492 1st c1st 7931 2nd c2nd 7932 |
| 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 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 ax-un 7680 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-iota 6448 df-fun 6494 df-fv 6500 df-1st 7933 df-2nd 7934 |
| This theorem is referenced by: releldm2 7987 |
| Copyright terms: Public domain | W3C validator |