Theorem xpidtr 6077

Description: A Cartesian square is a transitive relation. (Contributed by FL, 31-Jul-2009.)

Assertion

Ref	Expression
xpidtr	⊢ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴)) ⊆ (𝐴 × 𝐴)

Proof of Theorem xpidtr

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

Step	Hyp	Ref	Expression
1		brxp 5671	. . . . . 6 ⊢ (𝑥(𝐴 × 𝐴)𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴))
2		brxp 5671	. . . . . . . . 9 ⊢ (𝑦(𝐴 × 𝐴)𝑧 ↔ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴))
3		brxp 5671	. . . . . . . . . 10 ⊢ (𝑥(𝐴 × 𝐴)𝑧 ↔ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴))
4	3	simplbi2com 502	. . . . . . . . 9 ⊢ (𝑧 ∈ 𝐴 → (𝑥 ∈ 𝐴 → 𝑥(𝐴 × 𝐴)𝑧))
5	2, 4	simplbiim 504	. . . . . . . 8 ⊢ (𝑦(𝐴 × 𝐴)𝑧 → (𝑥 ∈ 𝐴 → 𝑥(𝐴 × 𝐴)𝑧))
6	5	com12 32	. . . . . . 7 ⊢ (𝑥 ∈ 𝐴 → (𝑦(𝐴 × 𝐴)𝑧 → 𝑥(𝐴 × 𝐴)𝑧))
7	6	adantr 480	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑦(𝐴 × 𝐴)𝑧 → 𝑥(𝐴 × 𝐴)𝑧))
8	1, 7	sylbi 217	. . . . 5 ⊢ (𝑥(𝐴 × 𝐴)𝑦 → (𝑦(𝐴 × 𝐴)𝑧 → 𝑥(𝐴 × 𝐴)𝑧))
9	8	imp 406	. . . 4 ⊢ ((𝑥(𝐴 × 𝐴)𝑦 ∧ 𝑦(𝐴 × 𝐴)𝑧) → 𝑥(𝐴 × 𝐴)𝑧)
10	9	ax-gen 1796	. . 3 ⊢ ∀𝑧((𝑥(𝐴 × 𝐴)𝑦 ∧ 𝑦(𝐴 × 𝐴)𝑧) → 𝑥(𝐴 × 𝐴)𝑧)
11	10	gen2 1797	. 2 ⊢ ∀𝑥∀𝑦∀𝑧((𝑥(𝐴 × 𝐴)𝑦 ∧ 𝑦(𝐴 × 𝐴)𝑧) → 𝑥(𝐴 × 𝐴)𝑧)
12		cotr 6067	. 2 ⊢ (((𝐴 × 𝐴) ∘ (𝐴 × 𝐴)) ⊆ (𝐴 × 𝐴) ↔ ∀𝑥∀𝑦∀𝑧((𝑥(𝐴 × 𝐴)𝑦 ∧ 𝑦(𝐴 × 𝐴)𝑧) → 𝑥(𝐴 × 𝐴)𝑧))
13	11, 12	mpbir 231	1 ⊢ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴)) ⊆ (𝐴 × 𝐴)

Syntax hints:   → wi 4   ∧ wa 395  ∀wal 1539   ∈ wcel 2113   ⊆ wss 3899   class class class wbr 5096   × cxp 5620   ∘ ccom 5626

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pr 5375

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2713  df-cleq 2726  df-clel 2809  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4284  df-if 4478  df-sn 4579  df-pr 4581  df-op 4585  df-br 5097  df-opab 5159  df-xp 5628  df-rel 5629  df-co 5631

This theorem is referenced by:  trinxp  6080  xpider  8723  trust  24171  rtrclex  43800  rtrclexi  43804