Theorem op1steq 6413

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 4883	. . 3 ⊢ (𝑉 × 𝑊) ⊆ (V × V)
2	1	sseli 3244	. 2 ⊢ (𝐴 ∈ (𝑉 × 𝑊) → 𝐴 ∈ (V × V))
3		eqid 2238	. . . . . 6 ⊢ (2nd ‘𝐴) = (2nd ‘𝐴)
4		eqopi 6406	. . . . . 6 ⊢ ((𝐴 ∈ (V × V) ∧ ((1st ‘𝐴) = 𝐵 ∧ (2nd ‘𝐴) = (2nd ‘𝐴))) → 𝐴 = ⟨𝐵, (2nd ‘𝐴)⟩)
5	3, 4	mpanr2 442	. . . . 5 ⊢ ((𝐴 ∈ (V × V) ∧ (1st ‘𝐴) = 𝐵) → 𝐴 = ⟨𝐵, (2nd ‘𝐴)⟩)
6		2ndexg 6402	. . . . . . 7 ⊢ (𝐴 ∈ (V × V) → (2nd ‘𝐴) ∈ V)
7		opeq2 3905	. . . . . . . . 9 ⊢ (𝑥 = (2nd ‘𝐴) → ⟨𝐵, 𝑥⟩ = ⟨𝐵, (2nd ‘𝐴)⟩)
8	7	eqeq2d 2250	. . . . . . . 8 ⊢ (𝑥 = (2nd ‘𝐴) → (𝐴 = ⟨𝐵, 𝑥⟩ ↔ 𝐴 = ⟨𝐵, (2nd ‘𝐴)⟩))
9	8	spcegv 2913	. . . . . . 7 ⊢ ((2nd ‘𝐴) ∈ V → (𝐴 = ⟨𝐵, (2nd ‘𝐴)⟩ → ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩))
10	6, 9	syl 14	. . . . . 6 ⊢ (𝐴 ∈ (V × V) → (𝐴 = ⟨𝐵, (2nd ‘𝐴)⟩ → ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩))
11	10	adantr 276	. . . . 5 ⊢ ((𝐴 ∈ (V × V) ∧ (1st ‘𝐴) = 𝐵) → (𝐴 = ⟨𝐵, (2nd ‘𝐴)⟩ → ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩))
12	5, 11	mpd 13	. . . 4 ⊢ ((𝐴 ∈ (V × V) ∧ (1st ‘𝐴) = 𝐵) → ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩)
13	12	ex 115	. . 3 ⊢ (𝐴 ∈ (V × V) → ((1st ‘𝐴) = 𝐵 → ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩))
14		eqop 6411	. . . . 5 ⊢ (𝐴 ∈ (V × V) → (𝐴 = ⟨𝐵, 𝑥⟩ ↔ ((1st ‘𝐴) = 𝐵 ∧ (2nd ‘𝐴) = 𝑥)))
15		simpl 109	. . . . 5 ⊢ (((1st ‘𝐴) = 𝐵 ∧ (2nd ‘𝐴) = 𝑥) → (1st ‘𝐴) = 𝐵)
16	14, 15	biimtrdi 163	. . . 4 ⊢ (𝐴 ∈ (V × V) → (𝐴 = ⟨𝐵, 𝑥⟩ → (1st ‘𝐴) = 𝐵))
17	16	exlimdv 1872	. . 3 ⊢ (𝐴 ∈ (V × V) → (∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩ → (1st ‘𝐴) = 𝐵))
18	13, 17	impbid 129	. 2 ⊢ (𝐴 ∈ (V × V) → ((1st ‘𝐴) = 𝐵 ↔ ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩))
19	2, 18	syl 14	1 ⊢ (𝐴 ∈ (𝑉 × 𝑊) → ((1st ‘𝐴) = 𝐵 ↔ ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402  ∃wex 1545   ∈ wcel 2209  Vcvv 2821  ⟨cop 3712   × cxp 4772  ‘cfv 5377  1^st c1st 6372  2^nd c2nd 6373

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fo 5383  df-fv 5385  df-1st 6374  df-2nd 6375

This theorem is used by:  releldm2  6419