Theorem opelopab3 35155

Description: Ordered pair membership in an ordered pair class abstraction, with a reduced hypothesis. (Contributed by Jeff Madsen, 29-May-2011.)

Hypotheses

Ref	Expression
opelopab3.1	⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
opelopab3.2	⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒))
opelopab3.3	⊢ (𝜒 → 𝐴 ∈ 𝐶)

Assertion

Ref	Expression
opelopab3	⊢ (𝐵 ∈ 𝐷 → (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ 𝜒))

Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦   𝜒,𝑥,𝑦

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

Proof of Theorem opelopab3

Step	Hyp	Ref	Expression
1		elopaelxp 5605	. . . . 5 ⊢ (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} → ⟨𝐴, 𝐵⟩ ∈ (V × V))
2		opelxp1 5560	. . . . 5 ⊢ (⟨𝐴, 𝐵⟩ ∈ (V × V) → 𝐴 ∈ V)
3	1, 2	syl 17	. . . 4 ⊢ (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} → 𝐴 ∈ V)
4	3	anim1i 617	. . 3 ⊢ ((⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ∧ 𝐵 ∈ 𝐷) → (𝐴 ∈ V ∧ 𝐵 ∈ 𝐷))
5	4	ancoms 462	. 2 ⊢ ((𝐵 ∈ 𝐷 ∧ ⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}) → (𝐴 ∈ V ∧ 𝐵 ∈ 𝐷))
6		opelopab3.3	. . . . 5 ⊢ (𝜒 → 𝐴 ∈ 𝐶)
7	6	elexd 3461	. . . 4 ⊢ (𝜒 → 𝐴 ∈ V)
8	7	anim1i 617	. . 3 ⊢ ((𝜒 ∧ 𝐵 ∈ 𝐷) → (𝐴 ∈ V ∧ 𝐵 ∈ 𝐷))
9	8	ancoms 462	. 2 ⊢ ((𝐵 ∈ 𝐷 ∧ 𝜒) → (𝐴 ∈ V ∧ 𝐵 ∈ 𝐷))
10		opelopab3.1	. . 3 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
11		opelopab3.2	. . 3 ⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒))
12	10, 11	opelopabg 5390	. 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ 𝐷) → (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ 𝜒))
13	5, 9, 12	pm5.21nd 801	1 ⊢ (𝐵 ∈ 𝐷 → (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ 𝜒))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2111  Vcvv 3441  ⟨cop 4531  {copab 5092   × cxp 5517

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pr 5295

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ral 3111  df-rex 3112  df-v 3443  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-op 4532  df-opab 5093  df-xp 5525

This theorem is referenced by: (None)