Theorem xpco 6292

Description: Composition of two Cartesian products. (Contributed by Thierry Arnoux, 17-Nov-2017.)

Assertion

Ref	Expression
xpco	⊢ (𝐵 ≠ ∅ → ((𝐵 × 𝐶) ∘ (𝐴 × 𝐵)) = (𝐴 × 𝐶))

Proof of Theorem xpco

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		n0 4299	. . . . . 6 ⊢ (𝐵 ≠ ∅ ↔ ∃𝑦 𝑦 ∈ 𝐵)
2	1	biimpi 219	. . . . 5 ⊢ (𝐵 ≠ ∅ → ∃𝑦 𝑦 ∈ 𝐵)
3	2	biantrurd 542	. . . 4 ⊢ (𝐵 ≠ ∅ → ((𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶) ↔ (∃𝑦 𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶))))
4		ancom 466	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ↔ (𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴))
5	4	anbi1i 636	. . . . . . 7 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶)) ↔ ((𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶)))
6		brxp 5699	. . . . . . . 8 ⊢ (𝑥(𝐴 × 𝐵)𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))
7		brxp 5699	. . . . . . . 8 ⊢ (𝑦(𝐵 × 𝐶)𝑧 ↔ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶))
8	6, 7	anbi12i 640	. . . . . . 7 ⊢ ((𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐵 × 𝐶)𝑧) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶)))
9		anandi 689	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)) ↔ ((𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶)))
10	5, 8, 9	3bitr4i 306	. . . . . 6 ⊢ ((𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐵 × 𝐶)𝑧) ↔ (𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)))
11	10	exbii 1880	. . . . 5 ⊢ (∃𝑦(𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐵 × 𝐶)𝑧) ↔ ∃𝑦(𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)))
12		19.41v 1981	. . . . 5 ⊢ (∃𝑦(𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)) ↔ (∃𝑦 𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)))
13	11, 12	bitr2i 279	. . . 4 ⊢ ((∃𝑦 𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)) ↔ ∃𝑦(𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐵 × 𝐶)𝑧))
14	3, 13	bitr2di 291	. . 3 ⊢ (𝐵 ≠ ∅ → (∃𝑦(𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐵 × 𝐶)𝑧) ↔ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)))
15	14	opabbidv 5170	. 2 ⊢ (𝐵 ≠ ∅ → {⟨𝑥, 𝑧⟩ ∣ ∃𝑦(𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐵 × 𝐶)𝑧)} = {⟨𝑥, 𝑧⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)})
16		df-co 5659	. 2 ⊢ ((𝐵 × 𝐶) ∘ (𝐴 × 𝐵)) = {⟨𝑥, 𝑧⟩ ∣ ∃𝑦(𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐵 × 𝐶)𝑧)}
17		df-xp 5656	. 2 ⊢ (𝐴 × 𝐶) = {⟨𝑥, 𝑧⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)}
18	15, 16, 17	3eqtr4g 2820	1 ⊢ (𝐵 ≠ ∅ → ((𝐵 × 𝐶) ∘ (𝐴 × 𝐵)) = (𝐴 × 𝐶))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2144   ≠ wne 2955  ∅c0 4278   class class class wbr 5102  {copab 5166   × cxp 5648   ∘ ccom 5654

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-opab 5167  df-xp 5656  df-co 5659

This theorem is used by:  xpcoid  6293  ustund  24547  ustneism  24549  cosnop  33336