Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  op1steq Structured version   Visualization version   GIF version

Theorem op1steq 7101
 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
StepHypRef Expression
1 xpss 5149 . . 3 (𝑉 × 𝑊) ⊆ (V × V)
21sseli 3564 . 2 (𝐴 ∈ (𝑉 × 𝑊) → 𝐴 ∈ (V × V))
3 eqid 2610 . . . . . 6 (2nd𝐴) = (2nd𝐴)
4 eqopi 7093 . . . . . 6 ((𝐴 ∈ (V × V) ∧ ((1st𝐴) = 𝐵 ∧ (2nd𝐴) = (2nd𝐴))) → 𝐴 = ⟨𝐵, (2nd𝐴)⟩)
53, 4mpanr2 716 . . . . 5 ((𝐴 ∈ (V × V) ∧ (1st𝐴) = 𝐵) → 𝐴 = ⟨𝐵, (2nd𝐴)⟩)
6 fvex 6113 . . . . . 6 (2nd𝐴) ∈ V
7 opeq2 4341 . . . . . . 7 (𝑥 = (2nd𝐴) → ⟨𝐵, 𝑥⟩ = ⟨𝐵, (2nd𝐴)⟩)
87eqeq2d 2620 . . . . . 6 (𝑥 = (2nd𝐴) → (𝐴 = ⟨𝐵, 𝑥⟩ ↔ 𝐴 = ⟨𝐵, (2nd𝐴)⟩))
96, 8spcev 3273 . . . . 5 (𝐴 = ⟨𝐵, (2nd𝐴)⟩ → ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩)
105, 9syl 17 . . . 4 ((𝐴 ∈ (V × V) ∧ (1st𝐴) = 𝐵) → ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩)
1110ex 449 . . 3 (𝐴 ∈ (V × V) → ((1st𝐴) = 𝐵 → ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩))
12 eqop 7099 . . . . 5 (𝐴 ∈ (V × V) → (𝐴 = ⟨𝐵, 𝑥⟩ ↔ ((1st𝐴) = 𝐵 ∧ (2nd𝐴) = 𝑥)))
13 simpl 472 . . . . 5 (((1st𝐴) = 𝐵 ∧ (2nd𝐴) = 𝑥) → (1st𝐴) = 𝐵)
1412, 13syl6bi 242 . . . 4 (𝐴 ∈ (V × V) → (𝐴 = ⟨𝐵, 𝑥⟩ → (1st𝐴) = 𝐵))
1514exlimdv 1848 . . 3 (𝐴 ∈ (V × V) → (∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩ → (1st𝐴) = 𝐵))
1611, 15impbid 201 . 2 (𝐴 ∈ (V × V) → ((1st𝐴) = 𝐵 ↔ ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩))
172, 16syl 17 1 (𝐴 ∈ (𝑉 × 𝑊) → ((1st𝐴) = 𝐵 ↔ ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 195   ∧ wa 383   = wceq 1475  ∃wex 1695   ∈ wcel 1977  Vcvv 3173  ⟨cop 4131   × cxp 5036  ‘cfv 5804  1st c1st 7057  2nd c2nd 7058 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-iota 5768  df-fun 5806  df-fv 5812  df-1st 7059  df-2nd 7060 This theorem is referenced by:  releldm2  7109
 Copyright terms: Public domain W3C validator