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

Theorem op1steq 8015
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 5664 . . 3 (𝑉 × 𝑊) ⊆ (V × V)
21sseli 3933 . 2 (𝐴 ∈ (𝑉 × 𝑊) → 𝐴 ∈ (V × V))
3 eqid 2763 . . . . . 6 (2nd𝐴) = (2nd𝐴)
4 eqopi 8007 . . . . . 6 ((𝐴 ∈ (V × V) ∧ ((1st𝐴) = 𝐵 ∧ (2nd𝐴) = (2nd𝐴))) → 𝐴 = ⟨𝐵, (2nd𝐴)⟩)
53, 4mpanr2 714 . . . . 5 ((𝐴 ∈ (V × V) ∧ (1st𝐴) = 𝐵) → 𝐴 = ⟨𝐵, (2nd𝐴)⟩)
6 fvex 6881 . . . . . 6 (2nd𝐴) ∈ V
7 opeq2 4833 . . . . . . 7 (𝑥 = (2nd𝐴) → ⟨𝐵, 𝑥⟩ = ⟨𝐵, (2nd𝐴)⟩)
87eqeq2d 2774 . . . . . 6 (𝑥 = (2nd𝐴) → (𝐴 = ⟨𝐵, 𝑥⟩ ↔ 𝐴 = ⟨𝐵, (2nd𝐴)⟩))
96, 8spcev 3566 . . . . 5 (𝐴 = ⟨𝐵, (2nd𝐴)⟩ → ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩)
105, 9syl 17 . . . 4 ((𝐴 ∈ (V × V) ∧ (1st𝐴) = 𝐵) → ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩)
1110ex 416 . . 3 (𝐴 ∈ (V × V) → ((1st𝐴) = 𝐵 → ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩))
12 eqop 8013 . . . . 5 (𝐴 ∈ (V × V) → (𝐴 = ⟨𝐵, 𝑥⟩ ↔ ((1st𝐴) = 𝐵 ∧ (2nd𝐴) = 𝑥)))
13 simpl 486 . . . . 5 (((1st𝐴) = 𝐵 ∧ (2nd𝐴) = 𝑥) → (1st𝐴) = 𝐵)
1412, 13biimtrdi 255 . . . 4 (𝐴 ∈ (V × V) → (𝐴 = ⟨𝐵, 𝑥⟩ → (1st𝐴) = 𝐵))
1514exlimdv 1954 . . 3 (𝐴 ∈ (V × V) → (∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩ → (1st𝐴) = 𝐵))
1611, 15impbid 214 . 2 (𝐴 ∈ (V × V) → ((1st𝐴) = 𝐵 ↔ ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩))
172, 16syl 17 1 (𝐴 ∈ (𝑉 × 𝑊) → ((1st𝐴) = 𝐵 ↔ ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399   = wceq 1561  wex 1800  wcel 2143  Vcvv 3455  cop 4589   × cxp 5646  cfv 6522  1st c1st 7969  2nd c2nd 7970
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1816  ax-4 1830  ax-5 1931  ax-6 1988  ax-7 2029  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5247  ax-nul 5257  ax-pr 5391  ax-un 7719
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1564  df-fal 1574  df-ex 1801  df-nf 1805  df-sb 2092  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3078  df-rex 3088  df-rab 3416  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5102  df-opab 5164  df-mpt 5183  df-id 5543  df-xp 5654  df-rel 5655  df-cnv 5656  df-co 5657  df-dm 5658  df-rn 5659  df-iota 6478  df-fun 6524  df-fv 6530  df-1st 7971  df-2nd 7972
This theorem is referenced by:  releldm2  8025
  Copyright terms: Public domain W3C validator