Theorem xpco 5675

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 3931	. . . . . 6 ⊢ (𝐵 ≠ ∅ ↔ ∃𝑦 𝑦 ∈ 𝐵)
2	1	biimpi 206	. . . . 5 ⊢ (𝐵 ≠ ∅ → ∃𝑦 𝑦 ∈ 𝐵)
3	2	biantrurd 529	. . . 4 ⊢ (𝐵 ≠ ∅ → ((𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶) ↔ (∃𝑦 𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶))))
4		ancom 466	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ↔ (𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴))
5	4	anbi1i 731	. . . . . . 7 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶)) ↔ ((𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶)))
6		brxp 5147	. . . . . . . 8 ⊢ (𝑥(𝐴 × 𝐵)𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))
7		brxp 5147	. . . . . . . 8 ⊢ (𝑦(𝐵 × 𝐶)𝑧 ↔ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶))
8	6, 7	anbi12i 733	. . . . . . 7 ⊢ ((𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐵 × 𝐶)𝑧) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶)))
9		anandi 871	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)) ↔ ((𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶)))
10	5, 8, 9	3bitr4i 292	. . . . . 6 ⊢ ((𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐵 × 𝐶)𝑧) ↔ (𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)))
11	10	exbii 1774	. . . . 5 ⊢ (∃𝑦(𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐵 × 𝐶)𝑧) ↔ ∃𝑦(𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)))
12		19.41v 1914	. . . . 5 ⊢ (∃𝑦(𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)) ↔ (∃𝑦 𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)))
13	11, 12	bitr2i 265	. . . 4 ⊢ ((∃𝑦 𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)) ↔ ∃𝑦(𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐵 × 𝐶)𝑧))
14	3, 13	syl6rbb 277	. . 3 ⊢ (𝐵 ≠ ∅ → (∃𝑦(𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐵 × 𝐶)𝑧) ↔ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)))
15	14	opabbidv 4716	. 2 ⊢ (𝐵 ≠ ∅ → {⟨𝑥, 𝑧⟩ ∣ ∃𝑦(𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐵 × 𝐶)𝑧)} = {⟨𝑥, 𝑧⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)})
16		df-co 5123	. 2 ⊢ ((𝐵 × 𝐶) ∘ (𝐴 × 𝐵)) = {⟨𝑥, 𝑧⟩ ∣ ∃𝑦(𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐵 × 𝐶)𝑧)}
17		df-xp 5120	. 2 ⊢ (𝐴 × 𝐶) = {⟨𝑥, 𝑧⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)}
18	15, 16, 17	3eqtr4g 2681	1 ⊢ (𝐵 ≠ ∅ → ((𝐵 × 𝐶) ∘ (𝐴 × 𝐵)) = (𝐴 × 𝐶))

Syntax hints:   → wi 4   ∧ wa 384   = wceq 1483  ∃wex 1704   ∈ wcel 1990   ≠ wne 2794  ∅c0 3915   class class class wbr 4653  {copab 4712   × cxp 5112   ∘ ccom 5118

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-br 4654  df-opab 4713  df-xp 5120  df-co 5123

This theorem is referenced by:  xpcoid  5676  ustund  22025  ustneism  22027