Theorem xpab 36460

Description: Cartesian product of two class abstractions. (Contributed by Scott Fenton, 19-Aug-2024.)

Assertion

Ref	Expression
xpab	⊢ ({𝑥 ∣ 𝜑} × {𝑦 ∣ 𝜓}) = {⟨𝑥, 𝑦⟩ ∣ (𝜑 ∧ 𝜓)}

Distinct variable groups:   𝜑,𝑦   𝜓,𝑥   𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)

Proof of Theorem xpab

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		relxp 5669	. 2 ⊢ Rel ({𝑥 ∣ 𝜑} × {𝑦 ∣ 𝜓})
2		relopabv 5799	. 2 ⊢ Rel {⟨𝑥, 𝑦⟩ ∣ (𝜑 ∧ 𝜓)}
3		df-clab 2740	. . . . 5 ⊢ (𝑎 ∈ {𝑥 ∣ 𝜑} ↔ [𝑎 / 𝑥]𝜑)
4		df-clab 2740	. . . . 5 ⊢ (𝑏 ∈ {𝑦 ∣ 𝜓} ↔ [𝑏 / 𝑦]𝜓)
5	3, 4	anbi12i 640	. . . 4 ⊢ ((𝑎 ∈ {𝑥 ∣ 𝜑} ∧ 𝑏 ∈ {𝑦 ∣ 𝜓}) ↔ ([𝑎 / 𝑥]𝜑 ∧ [𝑏 / 𝑦]𝜓))
6		sban 2117	. . . . . . 7 ⊢ ([𝑏 / 𝑦](𝜑 ∧ 𝜓) ↔ ([𝑏 / 𝑦]𝜑 ∧ [𝑏 / 𝑦]𝜓))
7		sbsbc 3743	. . . . . . 7 ⊢ ([𝑏 / 𝑦](𝜑 ∧ 𝜓) ↔ [𝑏 / 𝑦](𝜑 ∧ 𝜓))
8		sbv 2125	. . . . . . . 8 ⊢ ([𝑏 / 𝑦]𝜑 ↔ 𝜑)
9	8	anbi1i 636	. . . . . . 7 ⊢ (([𝑏 / 𝑦]𝜑 ∧ [𝑏 / 𝑦]𝜓) ↔ (𝜑 ∧ [𝑏 / 𝑦]𝜓))
10	6, 7, 9	3bitr3i 304	. . . . . 6 ⊢ ([𝑏 / 𝑦](𝜑 ∧ 𝜓) ↔ (𝜑 ∧ [𝑏 / 𝑦]𝜓))
11	10	sbbii 2113	. . . . 5 ⊢ ([𝑎 / 𝑥][𝑏 / 𝑦](𝜑 ∧ 𝜓) ↔ [𝑎 / 𝑥](𝜑 ∧ [𝑏 / 𝑦]𝜓))
12		sbsbc 3743	. . . . 5 ⊢ ([𝑎 / 𝑥][𝑏 / 𝑦](𝜑 ∧ 𝜓) ↔ [𝑎 / 𝑥][𝑏 / 𝑦](𝜑 ∧ 𝜓))
13		sban 2117	. . . . . 6 ⊢ ([𝑎 / 𝑥](𝜑 ∧ [𝑏 / 𝑦]𝜓) ↔ ([𝑎 / 𝑥]𝜑 ∧ [𝑎 / 𝑥][𝑏 / 𝑦]𝜓))
14		sbv 2125	. . . . . . 7 ⊢ ([𝑎 / 𝑥][𝑏 / 𝑦]𝜓 ↔ [𝑏 / 𝑦]𝜓)
15	14	anbi2i 635	. . . . . 6 ⊢ (([𝑎 / 𝑥]𝜑 ∧ [𝑎 / 𝑥][𝑏 / 𝑦]𝜓) ↔ ([𝑎 / 𝑥]𝜑 ∧ [𝑏 / 𝑦]𝜓))
16	13, 15	bitri 278	. . . . 5 ⊢ ([𝑎 / 𝑥](𝜑 ∧ [𝑏 / 𝑦]𝜓) ↔ ([𝑎 / 𝑥]𝜑 ∧ [𝑏 / 𝑦]𝜓))
17	11, 12, 16	3bitr3i 304	. . . 4 ⊢ ([𝑎 / 𝑥][𝑏 / 𝑦](𝜑 ∧ 𝜓) ↔ ([𝑎 / 𝑥]𝜑 ∧ [𝑏 / 𝑦]𝜓))
18	5, 17	bitr4i 281	. . 3 ⊢ ((𝑎 ∈ {𝑥 ∣ 𝜑} ∧ 𝑏 ∈ {𝑦 ∣ 𝜓}) ↔ [𝑎 / 𝑥][𝑏 / 𝑦](𝜑 ∧ 𝜓))
19		brxp 5700	. . 3 ⊢ (𝑎({𝑥 ∣ 𝜑} × {𝑦 ∣ 𝜓})𝑏 ↔ (𝑎 ∈ {𝑥 ∣ 𝜑} ∧ 𝑏 ∈ {𝑦 ∣ 𝜓}))
20		eqid 2761	. . . 4 ⊢ {⟨𝑥, 𝑦⟩ ∣ (𝜑 ∧ 𝜓)} = {⟨𝑥, 𝑦⟩ ∣ (𝜑 ∧ 𝜓)}
21	20	brabsb 5505	. . 3 ⊢ (𝑎{⟨𝑥, 𝑦⟩ ∣ (𝜑 ∧ 𝜓)}𝑏 ↔ [𝑎 / 𝑥][𝑏 / 𝑦](𝜑 ∧ 𝜓))
22	18, 19, 21	3bitr4i 306	. 2 ⊢ (𝑎({𝑥 ∣ 𝜑} × {𝑦 ∣ 𝜓})𝑏 ↔ 𝑎{⟨𝑥, 𝑦⟩ ∣ (𝜑 ∧ 𝜓)}𝑏)
23	1, 2, 22	eqbrriv 5767	1 ⊢ ({𝑥 ∣ 𝜑} × {𝑦 ∣ 𝜓}) = {⟨𝑥, 𝑦⟩ ∣ (𝜑 ∧ 𝜓)}

This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570  [wsb 2099   ∈ wcel 2145  {cab 2739  [wsbc 3739   class class class wbr 5103  {copab 5167   × cxp 5649

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-pr 5391

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-nf 1817  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-xp 5657  df-rel 5658

This theorem is used by: (None)