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

Theorem op1steq 8079
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 5674 . . 3 (𝑉 × 𝑊) ⊆ (V × V)
21sseli 3909 . 2 (𝐴 ∈ (𝑉 × 𝑊) → 𝐴 ∈ (V × V))
3 eqid 2763 . . . . . 6 (2nd ‘𝐴) = (2nd ‘𝐴)
4 eqopi 8071 . . . . . 6 ((𝐴 ∈ (V × V) ∧ ((1st ‘𝐴) = 𝐵 ∧ (2nd ‘𝐴) = (2nd ‘𝐴))) → 𝐴 = ⟨𝐵, (2nd ‘𝐴)⟩)
53, 4mpanr2 717 . . . . 5 ((𝐴 ∈ (V × V) ∧ (1st ‘𝐴) = 𝐵) → 𝐴 = ⟨𝐵, (2nd ‘𝐴)⟩)
6 fvex 6929 . . . . . 6 (2nd ‘𝐴) ∈ V
7 opeq2 4846 . . . . . . 7 (𝑥 = (2nd ‘𝐴) → ⟨𝐵, 𝑥⟩ = ⟨𝐵, (2nd ‘𝐴)⟩)
87eqeq2d 2774 . . . . . 6 (𝑥 = (2nd ‘𝐴) → (𝐴 = ⟨𝐵, 𝑥⟩ ↔ 𝐴 = ⟨𝐵, (2nd ‘𝐴)⟩))
96, 8spcev 3564 . . . . 5 (𝐴 = ⟨𝐵, (2nd ‘𝐴)⟩ → ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩)
105, 9syl 18 . . . 4 ((𝐴 ∈ (V × V) ∧ (1st ‘𝐴) = 𝐵) → ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩)
1110ex 418 . . 3 (𝐴 ∈ (V × V) → ((1st ‘𝐴) = 𝐵 → ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩))
12 eqop 8077 . . . . 5 (𝐴 ∈ (V × V) → (𝐴 = ⟨𝐵, 𝑥⟩ ↔ ((1st ‘𝐴) = 𝐵 ∧ (2nd ‘𝐴) = 𝑥)))
13 simpl 488 . . . . 5 (((1st ‘𝐴) = 𝐵 ∧ (2nd ‘𝐴) = 𝑥) → (1st ‘𝐴) = 𝐵)
1412, 13biimtrdi 256 . . . 4 (𝐴 ∈ (V × V) → (𝐴 = ⟨𝐵, 𝑥⟩ → (1st ‘𝐴) = 𝐵))
1514exlimdv 1968 . . 3 (𝐴 ∈ (V × V) → (∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩ → (1st ‘𝐴) = 𝐵))
1611, 15impbid 215 . 2 (𝐴 ∈ (V × V) → ((1st ‘𝐴) = 𝐵 ↔ ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩))
172, 16syl 18 1 (𝐴 ∈ (𝑉 × 𝑊) → ((1st ‘𝐴) = 𝐵 ↔ ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2147  Vcvv 3454  ⟨cop 4840   × cxp 5656  ‘cfv 6566  1st c1st 8033  2nd c2nd 8034
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-iota 6520  df-fun 6568  df-fv 6574  df-1st 8035  df-2nd 8036
This theorem is used by:  releldm2  8088
  Copyright terms: Public domain W3C validator