Theorem optocl 5118

Description: Implicit substitution of class for ordered pair. (Contributed by NM, 5-Mar-1995.)

Hypotheses

Ref	Expression
optocl.1	⊢ 𝐷 = (𝐵 × 𝐶)
optocl.2	⊢ (⟨𝑥, 𝑦⟩ = 𝐴 → (𝜑 ↔ 𝜓))
optocl.3	⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶) → 𝜑)

Assertion

Ref	Expression
optocl	⊢ (𝐴 ∈ 𝐷 → 𝜓)

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝐶,𝑦   𝜓,𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦)   𝐷(𝑥,𝑦)

Proof of Theorem optocl

Step	Hyp	Ref	Expression
1		elxp3 5092	. . 3 ⊢ (𝐴 ∈ (𝐵 × 𝐶) ↔ ∃𝑥∃𝑦(⟨𝑥, 𝑦⟩ = 𝐴 ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐶)))
2		opelxp 5070	. . . . . . 7 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐶) ↔ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))
3		optocl.3	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶) → 𝜑)
4	2, 3	sylbi 206	. . . . . 6 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐶) → 𝜑)
5		optocl.2	. . . . . 6 ⊢ (⟨𝑥, 𝑦⟩ = 𝐴 → (𝜑 ↔ 𝜓))
6	4, 5	syl5ib 233	. . . . 5 ⊢ (⟨𝑥, 𝑦⟩ = 𝐴 → (⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐶) → 𝜓))
7	6	imp 444	. . . 4 ⊢ ((⟨𝑥, 𝑦⟩ = 𝐴 ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐶)) → 𝜓)
8	7	exlimivv 1847	. . 3 ⊢ (∃𝑥∃𝑦(⟨𝑥, 𝑦⟩ = 𝐴 ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐶)) → 𝜓)
9	1, 8	sylbi 206	. 2 ⊢ (𝐴 ∈ (𝐵 × 𝐶) → 𝜓)
10		optocl.1	. 2 ⊢ 𝐷 = (𝐵 × 𝐶)
11	9, 10	eleq2s 2706	1 ⊢ (𝐴 ∈ 𝐷 → 𝜓)

Syntax hints:   → wi 4   ↔ wb 195   ∧ wa 383   = wceq 1475  ∃wex 1695   ∈ wcel 1977  ⟨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-ral 2901  df-rex 2902  df-rab 2905  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:  2optocl  5119  3optocl  5120  ecoptocl  7724  ax1rid  9861  axcnre  9864