Theorem copsex2ga 5717

Description: Implicit substitution inference for ordered pairs. Compare copsex2g 5407. (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

Step	Hyp	Ref	Expression
1		xpss 5605	. . 3 ⊢ (𝑉 × 𝑊) ⊆ (V × V)
2	1	sseli 3917	. 2 ⊢ (𝐴 ∈ (𝑉 × 𝑊) → 𝐴 ∈ (V × V))
3		copsex2ga.1	. . . 4 ⊢ (𝐴 = ⟨𝑥, 𝑦⟩ → (𝜑 ↔ 𝜓))
4	3	copsex2gb 5716	. . 3 ⊢ (∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ 𝜓) ↔ (𝐴 ∈ (V × V) ∧ 𝜑))
5	4	baibr 537	. 2 ⊢ (𝐴 ∈ (V × V) → (𝜑 ↔ ∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
6	2, 5	syl 17	1 ⊢ (𝐴 ∈ (𝑉 × 𝑊) → (𝜑 ↔ ∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1539  ∃wex 1782   ∈ wcel 2106  Vcvv 3432  ⟨cop 4567   × cxp 5587

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-opab 5137  df-xp 5595

This theorem is referenced by: (None)