Theorem op1steq 6127

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.)

Assertion

Ref	Expression
op1steq	⊢ (𝐴 ∈ (𝑉 × 𝑊) → ((1st ‘𝐴) = 𝐵 ↔ ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Allowed substitution hints:   𝑉(𝑥)   𝑊(𝑥)

Proof of Theorem op1steq

Step	Hyp	Ref	Expression
1		xpss 4694	. . 3 ⊢ (𝑉 × 𝑊) ⊆ (V × V)
2	1	sseli 3124	. 2 ⊢ (𝐴 ∈ (𝑉 × 𝑊) → 𝐴 ∈ (V × V))
3		eqid 2157	. . . . . 6 ⊢ (2nd ‘𝐴) = (2nd ‘𝐴)
4		eqopi 6120	. . . . . 6 ⊢ ((𝐴 ∈ (V × V) ∧ ((1st ‘𝐴) = 𝐵 ∧ (2nd ‘𝐴) = (2nd ‘𝐴))) → 𝐴 = ⟨𝐵, (2nd ‘𝐴)⟩)
5	3, 4	mpanr2 435	. . . . 5 ⊢ ((𝐴 ∈ (V × V) ∧ (1st ‘𝐴) = 𝐵) → 𝐴 = ⟨𝐵, (2nd ‘𝐴)⟩)
6		2ndexg 6116	. . . . . . 7 ⊢ (𝐴 ∈ (V × V) → (2nd ‘𝐴) ∈ V)
7		opeq2 3742	. . . . . . . . 9 ⊢ (𝑥 = (2nd ‘𝐴) → ⟨𝐵, 𝑥⟩ = ⟨𝐵, (2nd ‘𝐴)⟩)
8	7	eqeq2d 2169	. . . . . . . 8 ⊢ (𝑥 = (2nd ‘𝐴) → (𝐴 = ⟨𝐵, 𝑥⟩ ↔ 𝐴 = ⟨𝐵, (2nd ‘𝐴)⟩))
9	8	spcegv 2800	. . . . . . 7 ⊢ ((2nd ‘𝐴) ∈ V → (𝐴 = ⟨𝐵, (2nd ‘𝐴)⟩ → ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩))
10	6, 9	syl 14	. . . . . 6 ⊢ (𝐴 ∈ (V × V) → (𝐴 = ⟨𝐵, (2nd ‘𝐴)⟩ → ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩))
11	10	adantr 274	. . . . 5 ⊢ ((𝐴 ∈ (V × V) ∧ (1st ‘𝐴) = 𝐵) → (𝐴 = ⟨𝐵, (2nd ‘𝐴)⟩ → ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩))
12	5, 11	mpd 13	. . . 4 ⊢ ((𝐴 ∈ (V × V) ∧ (1st ‘𝐴) = 𝐵) → ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩)
13	12	ex 114	. . 3 ⊢ (𝐴 ∈ (V × V) → ((1st ‘𝐴) = 𝐵 → ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩))
14		eqop 6125	. . . . 5 ⊢ (𝐴 ∈ (V × V) → (𝐴 = ⟨𝐵, 𝑥⟩ ↔ ((1st ‘𝐴) = 𝐵 ∧ (2nd ‘𝐴) = 𝑥)))
15		simpl 108	. . . . 5 ⊢ (((1st ‘𝐴) = 𝐵 ∧ (2nd ‘𝐴) = 𝑥) → (1st ‘𝐴) = 𝐵)
16	14, 15	syl6bi 162	. . . 4 ⊢ (𝐴 ∈ (V × V) → (𝐴 = ⟨𝐵, 𝑥⟩ → (1st ‘𝐴) = 𝐵))
17	16	exlimdv 1799	. . 3 ⊢ (𝐴 ∈ (V × V) → (∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩ → (1st ‘𝐴) = 𝐵))
18	13, 17	impbid 128	. 2 ⊢ (𝐴 ∈ (V × V) → ((1st ‘𝐴) = 𝐵 ↔ ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩))
19	2, 18	syl 14	1 ⊢ (𝐴 ∈ (𝑉 × 𝑊) → ((1st ‘𝐴) = 𝐵 ↔ ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩))

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   = wceq 1335  ∃wex 1472   ∈ wcel 2128  Vcvv 2712  ⟨cop 3563   × cxp 4584  ‘cfv 5170  1^st c1st 6086  2^nd c2nd 6087

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 699  ax-5 1427  ax-7 1428  ax-gen 1429  ax-ie1 1473  ax-ie2 1474  ax-8 1484  ax-10 1485  ax-11 1486  ax-i12 1487  ax-bndl 1489  ax-4 1490  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-13 2130  ax-14 2131  ax-ext 2139  ax-sep 4082  ax-pow 4135  ax-pr 4169  ax-un 4393

This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1338  df-nf 1441  df-sb 1743  df-eu 2009  df-mo 2010  df-clab 2144  df-cleq 2150  df-clel 2153  df-nfc 2288  df-ral 2440  df-rex 2441  df-v 2714  df-sbc 2938  df-un 3106  df-in 3108  df-ss 3115  df-pw 3545  df-sn 3566  df-pr 3567  df-op 3569  df-uni 3773  df-br 3966  df-opab 4026  df-mpt 4027  df-id 4253  df-xp 4592  df-rel 4593  df-cnv 4594  df-co 4595  df-dm 4596  df-rn 4597  df-iota 5135  df-fun 5172  df-fn 5173  df-f 5174  df-fo 5176  df-fv 5178  df-1st 6088  df-2nd 6089

This theorem is referenced by:  releldm2  6133