Theorem xpiun 48744

Description: A Cartesian product expressed as indexed union of ordered-pair class abstractions. (Contributed by AV, 27-Jan-2020.)

Assertion

Ref	Expression
xpiun	⊢ (𝐵 × 𝐶) = ∪ 𝑥 ∈ 𝐵 {⟨𝑎, 𝑏⟩ ∣ (𝑎 = 𝑥 ∧ 𝑏 ∈ 𝐶)}

Distinct variable groups:   𝑥,𝐵   𝐶,𝑎,𝑏,𝑥

Allowed substitution hints:   𝐵(𝑎,𝑏)

Proof of Theorem xpiun

Step	Hyp	Ref	Expression
1		xpsnopab 48743	. . . . 5 ⊢ ({𝑥} × 𝐶) = {⟨𝑎, 𝑏⟩ ∣ (𝑎 = 𝑥 ∧ 𝑏 ∈ 𝐶)}
2	1	eqcomi 2770	. . . 4 ⊢ {⟨𝑎, 𝑏⟩ ∣ (𝑎 = 𝑥 ∧ 𝑏 ∈ 𝐶)} = ({𝑥} × 𝐶)
3	2	a1i 11	. . 3 ⊢ (𝑥 ∈ 𝐵 → {⟨𝑎, 𝑏⟩ ∣ (𝑎 = 𝑥 ∧ 𝑏 ∈ 𝐶)} = ({𝑥} × 𝐶))
4	3	iuneq2i 4970	. 2 ⊢ ∪ 𝑥 ∈ 𝐵 {⟨𝑎, 𝑏⟩ ∣ (𝑎 = 𝑥 ∧ 𝑏 ∈ 𝐶)} = ∪ 𝑥 ∈ 𝐵 ({𝑥} × 𝐶)
5		iunxpconst 5718	. 2 ⊢ ∪ 𝑥 ∈ 𝐵 ({𝑥} × 𝐶) = (𝐵 × 𝐶)
6	4, 5	eqtr2i 2785	1 ⊢ (𝐵 × 𝐶) = ∪ 𝑥 ∈ 𝐵 {⟨𝑎, 𝑏⟩ ∣ (𝑎 = 𝑥 ∧ 𝑏 ∈ 𝐶)}

Syntax hints:   ∧ wa 399   = wceq 1559   ∈ wcel 2141  {csn 4581  ∪ ciun 4948  {copab 5161   × cxp 5643

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-11 2190  ax-ext 2733  ax-sep 5245  ax-pr 5389

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-ex 1799  df-sb 2090  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-un 3909  df-in 3911  df-ss 3921  df-sn 4582  df-pr 4584  df-op 4588  df-iun 4950  df-opab 5162  df-xp 5651

This theorem is referenced by: (None)