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

Theorem copsex2ga 5154
 Description: Implicit substitution inference for ordered pairs. Compare copsex2g 4884. (Contributed by NM, 26-Feb-2014.) (Proof shortened by Mario Carneiro, 31-Aug-2015.)
Hypothesis
Ref Expression
copsex2ga.1 (𝐴 = ⟨𝑥, 𝑦⟩ → (𝜑𝜓))
Assertion
Ref Expression
copsex2ga (𝐴 ∈ (𝑉 × 𝑊) → (𝜑 ↔ ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
Distinct variable groups:   𝑥,𝑦,𝐴   𝜑,𝑥,𝑦
Allowed substitution hints:   𝜓(𝑥,𝑦)   𝑉(𝑥,𝑦)   𝑊(𝑥,𝑦)

Proof of Theorem copsex2ga
StepHypRef Expression
1 xpss 5149 . . 3 (𝑉 × 𝑊) ⊆ (V × V)
21sseli 3564 . 2 (𝐴 ∈ (𝑉 × 𝑊) → 𝐴 ∈ (V × V))
3 copsex2ga.1 . . . 4 (𝐴 = ⟨𝑥, 𝑦⟩ → (𝜑𝜓))
43copsex2gb 5153 . . 3 (∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ 𝜓) ↔ (𝐴 ∈ (V × V) ∧ 𝜑))
54baibr 943 . 2 (𝐴 ∈ (V × V) → (𝜑 ↔ ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
62, 5syl 17 1 (𝐴 ∈ (𝑉 × 𝑊) → (𝜑 ↔ ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
 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 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-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833 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-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-v 3175  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-opab 4644  df-xp 5044 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator