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

Theorem op1steq 8045
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 5667 . . 3 (𝑉 × 𝑊) ⊆ (V × V)
21sseli 3927 . 2 (𝐴 ∈ (𝑉 × 𝑊) → 𝐴 ∈ (V × V))
3 eqid 2761 . . . . . 6 (2nd ‘𝐴) = (2nd ‘𝐴)
4 eqopi 8037 . . . . . 6 ((𝐴 ∈ (V × V) ∧ ((1st ‘𝐴) = 𝐵 ∧ (2nd ‘𝐴) = (2nd ‘𝐴))) → 𝐴 = ⟨𝐵, (2nd ‘𝐴)⟩)
53, 4mpanr2 717 . . . . 5 ((𝐴 ∈ (V × V) ∧ (1st ‘𝐴) = 𝐵) → 𝐴 = ⟨𝐵, (2nd ‘𝐴)⟩)
6 fvex 6898 . . . . . 6 (2nd ‘𝐴) ∈ V
7 opeq2 4834 . . . . . . 7 (𝑥 = (2nd ‘𝐴) → ⟨𝐵, 𝑥⟩ = ⟨𝐵, (2nd ‘𝐴)⟩)
87eqeq2d 2772 . . . . . 6 (𝑥 = (2nd ‘𝐴) → (𝐴 = ⟨𝐵, 𝑥⟩ ↔ 𝐴 = ⟨𝐵, (2nd ‘𝐴)⟩))
96, 8spcev 3561 . . . . 5 (𝐴 = ⟨𝐵, (2nd ‘𝐴)⟩ → ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩)
105, 9syl 18 . . . 4 ((𝐴 ∈ (V × V) ∧ (1st ‘𝐴) = 𝐵) → ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩)
1110ex 418 . . 3 (𝐴 ∈ (V × V) → ((1st ‘𝐴) = 𝐵 → ∃𝑥 𝐴 = ⟨𝐵, 𝑥⟩))
12 eqop 8043 . . . . 5 (𝐴 ∈ (V × V) → (𝐴 = ⟨𝐵, 𝑥⟩ ↔ ((1st ‘𝐴) = 𝐵 ∧ (2nd ‘𝐴) = 𝑥)))
13 simpl 488 . . . . 5 (((1st ‘𝐴) = 𝐵 ∧ (2nd ‘𝐴) = 𝑥) → (1st ‘𝐴) = 𝐵)
1412, 13biimtrdi 256 . . . 4 (𝐴 ∈ (V × V) → (𝐴 = ⟨𝐵, 𝑥⟩ → (1st ‘𝐴) = 𝐵))
1514exlimdv 1966 . . 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 2145  Vcvv 3451  ⟨cop 4590   × cxp 5649  ‘cfv 6538  1st c1st 7999  2nd c2nd 8000
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7751
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-iota 6494  df-fun 6540  df-fv 6546  df-1st 8001  df-2nd 8002
This theorem is used by:  releldm2  8054
  Copyright terms: Public domain W3C validator