Theorem xpco 6272

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 4305	. . . . . 6 ⊢ (𝐵 ≠ ∅ ↔ ∃𝑦 𝑦 ∈ 𝐵)
2	1	biimpi 218	. . . . 5 ⊢ (𝐵 ≠ ∅ → ∃𝑦 𝑦 ∈ 𝐵)
3	2	biantrurd 540	. . . 4 ⊢ (𝐵 ≠ ∅ → ((𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶) ↔ (∃𝑦 𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶))))
4		ancom 464	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ↔ (𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴))
5	4	anbi1i 633	. . . . . . 7 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶)) ↔ ((𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶)))
6		brxp 5694	. . . . . . . 8 ⊢ (𝑥(𝐴 × 𝐵)𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))
7		brxp 5694	. . . . . . . 8 ⊢ (𝑦(𝐵 × 𝐶)𝑧 ↔ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶))
8	6, 7	anbi12i 637	. . . . . . 7 ⊢ ((𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐵 × 𝐶)𝑧) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶)))
9		anandi 686	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)) ↔ ((𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶)))
10	5, 8, 9	3bitr4i 305	. . . . . 6 ⊢ ((𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐵 × 𝐶)𝑧) ↔ (𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)))
11	10	exbii 1867	. . . . 5 ⊢ (∃𝑦(𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐵 × 𝐶)𝑧) ↔ ∃𝑦(𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)))
12		19.41v 1968	. . . . 5 ⊢ (∃𝑦(𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)) ↔ (∃𝑦 𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)))
13	11, 12	bitr2i 278	. . . 4 ⊢ ((∃𝑦 𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)) ↔ ∃𝑦(𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐵 × 𝐶)𝑧))
14	3, 13	bitr2di 290	. . 3 ⊢ (𝐵 ≠ ∅ → (∃𝑦(𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐵 × 𝐶)𝑧) ↔ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)))
15	14	opabbidv 5165	. 2 ⊢ (𝐵 ≠ ∅ → {⟨𝑥, 𝑧⟩ ∣ ∃𝑦(𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐵 × 𝐶)𝑧)} = {⟨𝑥, 𝑧⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)})
16		df-co 5654	. 2 ⊢ ((𝐵 × 𝐶) ∘ (𝐴 × 𝐵)) = {⟨𝑥, 𝑧⟩ ∣ ∃𝑦(𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐵 × 𝐶)𝑧)}
17		df-xp 5651	. 2 ⊢ (𝐴 × 𝐶) = {⟨𝑥, 𝑧⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)}
18	15, 16, 17	3eqtr4g 2821	1 ⊢ (𝐵 ≠ ∅ → ((𝐵 × 𝐶) ∘ (𝐴 × 𝐵)) = (𝐴 × 𝐶))

Syntax hints:   → wi 4   ∧ wa 399   = wceq 1559  ∃wex 1798   ∈ wcel 2141   ≠ wne 2956  ∅c0 4285   class class class wbr 5099  {copab 5161   × cxp 5643   ∘ ccom 5649

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-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-fal 1572  df-ex 1799  df-sb 2090  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-sn 4582  df-pr 4584  df-op 4588  df-br 5100  df-opab 5162  df-xp 5651  df-co 5654

This theorem is referenced by:  xpcoid  6273  ustund  24262  ustneism  24264  cosnop  32847