Theorem xpider 8785

Description: A Cartesian square is an equivalence relation (in general, it is not a poset). (Contributed by FL, 31-Jul-2009.) (Revised by Mario Carneiro, 12-Aug-2015.)

Assertion

Ref	Expression
xpider	⊢ (𝐴 × 𝐴) Er 𝐴

Proof of Theorem xpider

Step	Hyp	Ref	Expression
1		relxp 5679	. 2 ⊢ Rel (𝐴 × 𝐴)
2		dmxpid 5920	. 2 ⊢ dom (𝐴 × 𝐴) = 𝐴
3		cnvxp 6154	. . 3 ⊢ ◡(𝐴 × 𝐴) = (𝐴 × 𝐴)
4		xpidtr 6122	. . 3 ⊢ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴)) ⊆ (𝐴 × 𝐴)
5		uneq1 4114	. . . 4 ⊢ (◡(𝐴 × 𝐴) = (𝐴 × 𝐴) → (◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)))
6		unss2 4139	. . . 4 ⊢ (((𝐴 × 𝐴) ∘ (𝐴 × 𝐴)) ⊆ (𝐴 × 𝐴) → (◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)))
7		unidm 4110	. . . . 5 ⊢ ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = (𝐴 × 𝐴)
8		eqtr 2781	. . . . . 6 ⊢ (((◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) ∧ ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = (𝐴 × 𝐴)) → (◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = (𝐴 × 𝐴))
9		sseq2 3962	. . . . . . 7 ⊢ ((◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = (𝐴 × 𝐴) → ((◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) ↔ (◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (𝐴 × 𝐴)))
10	9	biimpd 232	. . . . . 6 ⊢ ((◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = (𝐴 × 𝐴) → ((◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) → (◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (𝐴 × 𝐴)))
11	8, 10	syl 18	. . . . 5 ⊢ (((◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) ∧ ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = (𝐴 × 𝐴)) → ((◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) → (◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (𝐴 × 𝐴)))
12	7, 11	mpan2 703	. . . 4 ⊢ ((◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) → ((◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) → (◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (𝐴 × 𝐴)))
13	5, 6, 12	syl2im 41	. . 3 ⊢ (◡(𝐴 × 𝐴) = (𝐴 × 𝐴) → (((𝐴 × 𝐴) ∘ (𝐴 × 𝐴)) ⊆ (𝐴 × 𝐴) → (◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (𝐴 × 𝐴)))
14	3, 4, 13	mp2 9	. 2 ⊢ (◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (𝐴 × 𝐴)
15		df-er 8693	. 2 ⊢ ((𝐴 × 𝐴) Er 𝐴 ↔ (Rel (𝐴 × 𝐴) ∧ dom (𝐴 × 𝐴) = 𝐴 ∧ (◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (𝐴 × 𝐴)))
16	1, 2, 14, 15	mpbir3an 1358	1 ⊢ (𝐴 × 𝐴) Er 𝐴

Syntax hints:   → wi 4   ∧ wa 400   = wceq 1568   ∪ cun 3902   ⊆ wss 3904   × cxp 5659  ^◡ccnv 5660  dom cdm 5661   ∘ ccom 5665  Rel wrel 5666   Er wer 8690

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2143  ax-9 2151  ax-11 2190  ax-ext 2733  ax-sep 5256  ax-pr 5404

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1571  df-fal 1581  df-ex 1808  df-sb 2095  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3415  df-v 3455  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-br 5109  df-opab 5173  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-er 8693

This theorem is referenced by:  riiner  8787  efglem  19785