Theorem opelopab3 38844

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 5746	. . . . 5 ⊢ (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} → ⟨𝐴, 𝐵⟩ ∈ (V × V))
2		opelxp1 5697	. . . . 5 ⊢ (⟨𝐴, 𝐵⟩ ∈ (V × V) → 𝐴 ∈ V)
3	1, 2	syl 18	. . . 4 ⊢ (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} → 𝐴 ∈ V)
4	3	anim1i 627	. . 3 ⊢ ((⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ∧ 𝐵 ∈ 𝐷) → (𝐴 ∈ V ∧ 𝐵 ∈ 𝐷))
5	4	ancoms 464	. 2 ⊢ ((𝐵 ∈ 𝐷 ∧ ⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}) → (𝐴 ∈ V ∧ 𝐵 ∈ 𝐷))
6		opelopab3.3	. . . . 5 ⊢ (𝜒 → 𝐴 ∈ 𝐶)
7	6	elexd 3477	. . . 4 ⊢ (𝜒 → 𝐴 ∈ V)
8	7	anim1i 627	. . 3 ⊢ ((𝜒 ∧ 𝐵 ∈ 𝐷) → (𝐴 ∈ V ∧ 𝐵 ∈ 𝐷))
9	8	ancoms 464	. 2 ⊢ ((𝐵 ∈ 𝐷 ∧ 𝜒) → (𝐴 ∈ V ∧ 𝐵 ∈ 𝐷))
10		opelopab3.1	. . 3 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
11		opelopab3.2	. . 3 ⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒))
12	10, 11	opelopabg 5517	. 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ 𝐷) → (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ 𝜒))
13	5, 9, 12	pm5.21nd 814	1 ⊢ (𝐵 ∈ 𝐷 → (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ 𝜒))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454  ⟨cop 4838  {copab 5170   × cxp 5653

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5252  ax-pr 5395

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-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-opab 5171  df-xp 5661

This theorem is used by: (None)