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

Theorem op1steq 7735
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 5573 . . 3 (𝑉 × 𝑊) ⊆ (V × V)
21sseli 3965 . 2 (𝐴 ∈ (𝑉 × 𝑊) → 𝐴 ∈ (V × V))
3 eqid 2823 . . . . . 6 (2nd𝐴) = (2nd𝐴)
4 eqopi 7727 . . . . . 6 ((𝐴 ∈ (V × V) ∧ ((1st𝐴) = 𝐵 ∧ (2nd𝐴) = (2nd𝐴))) → 𝐴 = ⟨𝐵, (2nd𝐴)⟩)
53, 4mpanr2 702 . . . . 5 ((𝐴 ∈ (V × V) ∧ (1st𝐴) = 𝐵) → 𝐴 = ⟨𝐵, (2nd𝐴)⟩)
6 fvex 6685 . . . . . 6 (2nd𝐴) ∈ V
7 opeq2 4806 . . . . . . 7 (𝑥 = (2nd𝐴) → ⟨𝐵, 𝑥⟩ = ⟨𝐵, (2nd𝐴)⟩)
87eqeq2d 2834 . . . . . 6 (𝑥 = (2nd𝐴) → (𝐴 = ⟨𝐵, 𝑥⟩ ↔ 𝐴 = ⟨𝐵, (2nd𝐴)⟩))
96, 8spcev 3609 . . . . 5 (𝐴 = ⟨𝐵, (2nd𝐴)⟩ → ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩)
105, 9syl 17 . . . 4 ((𝐴 ∈ (V × V) ∧ (1st𝐴) = 𝐵) → ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩)
1110ex 415 . . 3 (𝐴 ∈ (V × V) → ((1st𝐴) = 𝐵 → ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩))
12 eqop 7733 . . . . 5 (𝐴 ∈ (V × V) → (𝐴 = ⟨𝐵, 𝑥⟩ ↔ ((1st𝐴) = 𝐵 ∧ (2nd𝐴) = 𝑥)))
13 simpl 485 . . . . 5 (((1st𝐴) = 𝐵 ∧ (2nd𝐴) = 𝑥) → (1st𝐴) = 𝐵)
1412, 13syl6bi 255 . . . 4 (𝐴 ∈ (V × V) → (𝐴 = ⟨𝐵, 𝑥⟩ → (1st𝐴) = 𝐵))
1514exlimdv 1934 . . 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 398   = wceq 1537  wex 1780  wcel 2114  Vcvv 3496  cop 4575   × cxp 5555  cfv 6357  1st c1st 7689  2nd c2nd 7690
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ral 3145  df-rex 3146  df-rab 3149  df-v 3498  df-sbc 3775  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-br 5069  df-opab 5131  df-mpt 5149  df-id 5462  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-iota 6316  df-fun 6359  df-fv 6365  df-1st 7691  df-2nd 7692
This theorem is referenced by:  releldm2  7744
  Copyright terms: Public domain W3C validator