Theorem opabssxpd 5685

Description: An ordered-pair class abstraction is a subset of a Cartesian product. Formerly part of proof for opabex2 8036. (Contributed by AV, 26-Nov-2021.)

Hypotheses

Ref	Expression
opabssxpd.x	⊢ ((𝜑 ∧ 𝜓) → 𝑥 ∈ 𝐴)
opabssxpd.y	⊢ ((𝜑 ∧ 𝜓) → 𝑦 ∈ 𝐵)

Assertion

Ref	Expression
opabssxpd	⊢ (𝜑 → {⟨𝑥, 𝑦⟩ ∣ 𝜓} ⊆ (𝐴 × 𝐵))

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

Allowed substitution hints:   𝜓(𝑥,𝑦)

Proof of Theorem opabssxpd

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-opab 5170	. 2 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝜓} = {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)}
2		simprl 770	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)) → 𝑧 = ⟨𝑥, 𝑦⟩)
3		opabssxpd.x	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝜓) → 𝑥 ∈ 𝐴)
4		opabssxpd.y	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝜓) → 𝑦 ∈ 𝐵)
5	3, 4	opelxpd 5677	. . . . . . 7 ⊢ ((𝜑 ∧ 𝜓) → ⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵))
6	5	adantrl 716	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)) → ⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵))
7	2, 6	eqeltrd 2828	. . . . 5 ⊢ ((𝜑 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)) → 𝑧 ∈ (𝐴 × 𝐵))
8	7	ex 412	. . . 4 ⊢ (𝜑 → ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓) → 𝑧 ∈ (𝐴 × 𝐵)))
9	8	exlimdvv 1934	. . 3 ⊢ (𝜑 → (∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓) → 𝑧 ∈ (𝐴 × 𝐵)))
10	9	abssdv 4031	. 2 ⊢ (𝜑 → {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)} ⊆ (𝐴 × 𝐵))
11	1, 10	eqsstrid 3985	1 ⊢ (𝜑 → {⟨𝑥, 𝑦⟩ ∣ 𝜓} ⊆ (𝐴 × 𝐵))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1540  ∃wex 1779   ∈ wcel 2109  {cab 2707   ⊆ wss 3914  ⟨cop 4595  {copab 5169   × cxp 5636

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-opab 5170  df-xp 5644

This theorem is referenced by:  opabex2  8036  erlval  33209  uspgropssxp  48132