Theorem xpidtr 6111

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 5698	. . . . . 6 ⊢ (𝑥(𝐴 × 𝐴)𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴))
2		brxp 5698	. . . . . . . . 9 ⊢ (𝑦(𝐴 × 𝐴)𝑧 ↔ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴))
3		brxp 5698	. . . . . . . . . 10 ⊢ (𝑥(𝐴 × 𝐴)𝑧 ↔ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴))
4	3	simplbi2com 506	. . . . . . . . 9 ⊢ (𝑧 ∈ 𝐴 → (𝑥 ∈ 𝐴 → 𝑥(𝐴 × 𝐴)𝑧))
5	2, 4	simplbiim 512	. . . . . . . 8 ⊢ (𝑦(𝐴 × 𝐴)𝑧 → (𝑥 ∈ 𝐴 → 𝑥(𝐴 × 𝐴)𝑧))
6	5	com12 32	. . . . . . 7 ⊢ (𝑥 ∈ 𝐴 → (𝑦(𝐴 × 𝐴)𝑧 → 𝑥(𝐴 × 𝐴)𝑧))
7	6	adantr 484	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑦(𝐴 × 𝐴)𝑧 → 𝑥(𝐴 × 𝐴)𝑧))
8	1, 7	sylbi 219	. . . . 5 ⊢ (𝑥(𝐴 × 𝐴)𝑦 → (𝑦(𝐴 × 𝐴)𝑧 → 𝑥(𝐴 × 𝐴)𝑧))
9	8	imp 410	. . . 4 ⊢ ((𝑥(𝐴 × 𝐴)𝑦 ∧ 𝑦(𝐴 × 𝐴)𝑧) → 𝑥(𝐴 × 𝐴)𝑧)
10	9	ax-gen 1817	. . 3 ⊢ ∀𝑧((𝑥(𝐴 × 𝐴)𝑦 ∧ 𝑦(𝐴 × 𝐴)𝑧) → 𝑥(𝐴 × 𝐴)𝑧)
11	10	gen2 1818	. 2 ⊢ ∀𝑥∀𝑦∀𝑧((𝑥(𝐴 × 𝐴)𝑦 ∧ 𝑦(𝐴 × 𝐴)𝑧) → 𝑥(𝐴 × 𝐴)𝑧)
12		cotr 6101	. 2 ⊢ (((𝐴 × 𝐴) ∘ (𝐴 × 𝐴)) ⊆ (𝐴 × 𝐴) ↔ ∀𝑥∀𝑦∀𝑧((𝑥(𝐴 × 𝐴)𝑦 ∧ 𝑦(𝐴 × 𝐴)𝑧) → 𝑥(𝐴 × 𝐴)𝑧))
13	11, 12	mpbir 233	1 ⊢ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴)) ⊆ (𝐴 × 𝐴)

Syntax hints:   → wi 4   ∧ wa 399  ∀wal 1560   ∈ wcel 2144   ⊆ wss 3906   class class class wbr 5102   × cxp 5647   ∘ ccom 5653

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-ext 2736  ax-sep 5248  ax-pr 5392

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-sb 2093  df-clab 2743  df-cleq 2756  df-clel 2839  df-ral 3079  df-rex 3089  df-rab 3417  df-v 3458  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5103  df-opab 5165  df-xp 5655  df-rel 5656  df-co 5658

This theorem is referenced by:  trinxp  6114  xpider  8772  trust  24291  rtrclex  44198  rtrclexi  44202