Theorem xpco 6291

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 4303	. . . . . 6 ⊢ (𝐵 ≠ ∅ ↔ ∃𝑦 𝑦 ∈ 𝐵)
2	1	biimpi 219	. . . . 5 ⊢ (𝐵 ≠ ∅ → ∃𝑦 𝑦 ∈ 𝐵)
3	2	biantrurd 542	. . . 4 ⊢ (𝐵 ≠ ∅ → ((𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶) ↔ (∃𝑦 𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶))))
4		ancom 466	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ↔ (𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴))
5	4	anbi1i 636	. . . . . . 7 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶)) ↔ ((𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶)))
6		brxp 5708	. . . . . . . 8 ⊢ (𝑥(𝐴 × 𝐵)𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))
7		brxp 5708	. . . . . . . 8 ⊢ (𝑦(𝐵 × 𝐶)𝑧 ↔ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶))
8	6, 7	anbi12i 640	. . . . . . 7 ⊢ ((𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐵 × 𝐶)𝑧) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶)))
9		anandi 689	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)) ↔ ((𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶)))
10	5, 8, 9	3bitr4i 306	. . . . . 6 ⊢ ((𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐵 × 𝐶)𝑧) ↔ (𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)))
11	10	exbii 1881	. . . . 5 ⊢ (∃𝑦(𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐵 × 𝐶)𝑧) ↔ ∃𝑦(𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)))
12		19.41v 1982	. . . . 5 ⊢ (∃𝑦(𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)) ↔ (∃𝑦 𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)))
13	11, 12	bitr2i 279	. . . 4 ⊢ ((∃𝑦 𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)) ↔ ∃𝑦(𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐵 × 𝐶)𝑧))
14	3, 13	bitr2di 291	. . 3 ⊢ (𝐵 ≠ ∅ → (∃𝑦(𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐵 × 𝐶)𝑧) ↔ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)))
15	14	opabbidv 5175	. 2 ⊢ (𝐵 ≠ ∅ → {⟨𝑥, 𝑧⟩ ∣ ∃𝑦(𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐵 × 𝐶)𝑧)} = {⟨𝑥, 𝑧⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)})
16		df-co 5668	. 2 ⊢ ((𝐵 × 𝐶) ∘ (𝐴 × 𝐵)) = {⟨𝑥, 𝑧⟩ ∣ ∃𝑦(𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐵 × 𝐶)𝑧)}
17		df-xp 5665	. 2 ⊢ (𝐴 × 𝐶) = {⟨𝑥, 𝑧⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)}
18	15, 16, 17	3eqtr4g 2822	1 ⊢ (𝐵 ≠ ∅ → ((𝐵 × 𝐶) ∘ (𝐴 × 𝐵)) = (𝐴 × 𝐶))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145   ≠ wne 2957  ∅c0 4282   class class class wbr 5107  {copab 5171   × cxp 5657   ∘ ccom 5663

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-ext 2734  ax-sep 5255  ax-pr 5402

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-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-br 5108  df-opab 5172  df-xp 5665  df-co 5668

This theorem is used by:  xpcoid  6292  ustund  24454  ustneism  24456  cosnop  33175