Theorem opelxpii 5676

Description: Ordered pair membership in a Cartesian product (implication), induction form. (Contributed by Steven Nguyen, 17-Jul-2022.)

Hypotheses

Ref	Expression
opelxpii.1	⊢ 𝐴 ∈ 𝐶
opelxpii.2	⊢ 𝐵 ∈ 𝐷

Assertion

Ref	Expression
opelxpii	⊢ ⟨𝐴, 𝐵⟩ ∈ (𝐶 × 𝐷)

Proof of Theorem opelxpii

Step	Hyp	Ref	Expression
1		opelxpii.1	. 2 ⊢ 𝐴 ∈ 𝐶
2		opelxpii.2	. 2 ⊢ 𝐵 ∈ 𝐷
3		opelxpi 5675	. 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → ⟨𝐴, 𝐵⟩ ∈ (𝐶 × 𝐷))
4	1, 2, 3	mp2an 692	1 ⊢ ⟨𝐴, 𝐵⟩ ∈ (𝐶 × 𝐷)

Syntax hints:   ∈ wcel 2109  ⟨cop 4595   × 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:  pzriprnglem7  21397  pzriprng1ALT  21406