Theorem bj-xpcossxp 37949

Description: The composition of two Cartesian products is included in the expected Cartesian product. There is equality if (𝐵 ∩ 𝐶) ≠ ∅, see xpcogend 15051. (Contributed by BJ, 22-May-2024.)

Assertion

Ref	Expression
bj-xpcossxp	⊢ ((𝐶 × 𝐷) ∘ (𝐴 × 𝐵)) ⊆ (𝐴 × 𝐷)

Proof of Theorem bj-xpcossxp

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

Step	Hyp	Ref	Expression
1		brxp 5708	. . . . . . 7 ⊢ (𝑥(𝐴 × 𝐵)𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))
2		brxp 5708	. . . . . . 7 ⊢ (𝑦(𝐶 × 𝐷)𝑡 ↔ (𝑦 ∈ 𝐶 ∧ 𝑡 ∈ 𝐷))
3	1, 2	anbi12i 640	. . . . . 6 ⊢ ((𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐶 × 𝐷)𝑡) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝑦 ∈ 𝐶 ∧ 𝑡 ∈ 𝐷)))
4		an43 671	. . . . . 6 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝑦 ∈ 𝐶 ∧ 𝑡 ∈ 𝐷)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑡 ∈ 𝐷) ∧ (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)))
5	3, 4	bitri 278	. . . . 5 ⊢ ((𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐶 × 𝐷)𝑡) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑡 ∈ 𝐷) ∧ (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)))
6	5	exbii 1881	. . . 4 ⊢ (∃𝑦(𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐶 × 𝐷)𝑡) ↔ ∃𝑦((𝑥 ∈ 𝐴 ∧ 𝑡 ∈ 𝐷) ∧ (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)))
7		19.42v 1986	. . . . 5 ⊢ (∃𝑦((𝑥 ∈ 𝐴 ∧ 𝑡 ∈ 𝐷) ∧ (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑡 ∈ 𝐷) ∧ ∃𝑦(𝑦 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)))
8	7	simplbi 502	. . . 4 ⊢ (∃𝑦((𝑥 ∈ 𝐴 ∧ 𝑡 ∈ 𝐷) ∧ (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) → (𝑥 ∈ 𝐴 ∧ 𝑡 ∈ 𝐷))
9	6, 8	sylbi 220	. . 3 ⊢ (∃𝑦(𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐶 × 𝐷)𝑡) → (𝑥 ∈ 𝐴 ∧ 𝑡 ∈ 𝐷))
10	9	ssopab2i 5533	. 2 ⊢ {⟨𝑥, 𝑡⟩ ∣ ∃𝑦(𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐶 × 𝐷)𝑡)} ⊆ {⟨𝑥, 𝑡⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑡 ∈ 𝐷)}
11		df-co 5668	. 2 ⊢ ((𝐶 × 𝐷) ∘ (𝐴 × 𝐵)) = {⟨𝑥, 𝑡⟩ ∣ ∃𝑦(𝑥(𝐴 × 𝐵)𝑦 ∧ 𝑦(𝐶 × 𝐷)𝑡)}
12		df-xp 5665	. 2 ⊢ (𝐴 × 𝐷) = {⟨𝑥, 𝑡⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑡 ∈ 𝐷)}
13	10, 11, 12	3sstr4i 3985	1 ⊢ ((𝐶 × 𝐷) ∘ (𝐴 × 𝐵)) ⊆ (𝐴 × 𝐷)

This proof depends on syntax axioms:   ∧ wa 401  ∃wex 1812   ∈ wcel 2145   ⊆ wss 3902   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-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:  bj-imdirco  37950