Theorem eqopi 6257

Description: Equality with an ordered pair. (Contributed by NM, 15-Dec-2008.) (Revised by Mario Carneiro, 23-Feb-2014.)

Assertion

Ref	Expression
eqopi	⊢ ((𝐴 ∈ (𝑉 × 𝑊) ∧ ((1st ‘𝐴) = 𝐵 ∧ (2nd ‘𝐴) = 𝐶)) → 𝐴 = ⟨𝐵, 𝐶⟩)

Proof of Theorem eqopi

Step	Hyp	Ref	Expression
1		xpss 4782	. . 3 ⊢ (𝑉 × 𝑊) ⊆ (V × V)
2	1	sseli 3188	. 2 ⊢ (𝐴 ∈ (𝑉 × 𝑊) → 𝐴 ∈ (V × V))
3		elxp6 6254	. . . 4 ⊢ (𝐴 ∈ (V × V) ↔ (𝐴 = ⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∧ ((1st ‘𝐴) ∈ V ∧ (2nd ‘𝐴) ∈ V)))
4	3	simplbi 274	. . 3 ⊢ (𝐴 ∈ (V × V) → 𝐴 = ⟨(1st ‘𝐴), (2nd ‘𝐴)⟩)
5		opeq12 3820	. . 3 ⊢ (((1st ‘𝐴) = 𝐵 ∧ (2nd ‘𝐴) = 𝐶) → ⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ = ⟨𝐵, 𝐶⟩)
6	4, 5	sylan9eq 2257	. 2 ⊢ ((𝐴 ∈ (V × V) ∧ ((1st ‘𝐴) = 𝐵 ∧ (2nd ‘𝐴) = 𝐶)) → 𝐴 = ⟨𝐵, 𝐶⟩)
7	2, 6	sylan 283	1 ⊢ ((𝐴 ∈ (𝑉 × 𝑊) ∧ ((1st ‘𝐴) = 𝐵 ∧ (2nd ‘𝐴) = 𝐶)) → 𝐴 = ⟨𝐵, 𝐶⟩)

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1372   ∈ wcel 2175  Vcvv 2771  ⟨cop 3635   × cxp 4672  ‘cfv 5270  1^st c1st 6223  2^nd c2nd 6224

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-13 2177  ax-14 2178  ax-ext 2186  ax-sep 4161  ax-pow 4217  ax-pr 4252  ax-un 4479

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1375  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ral 2488  df-rex 2489  df-v 2773  df-sbc 2998  df-un 3169  df-in 3171  df-ss 3178  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-br 4044  df-opab 4105  df-mpt 4106  df-id 4339  df-xp 4680  df-rel 4681  df-cnv 4682  df-co 4683  df-dm 4684  df-rn 4685  df-iota 5231  df-fun 5272  df-fv 5278  df-1st 6225  df-2nd 6226

This theorem is referenced by:  op1steq  6264  dfoprab3  6276  1stconst  6306  2ndconst  6307  cnvoprab  6319  upxp  14715