Theorem xpider 8535

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 5598	. 2 ⊢ Rel (𝐴 × 𝐴)
2		dmxpid 5828	. 2 ⊢ dom (𝐴 × 𝐴) = 𝐴
3		cnvxp 6049	. . 3 ⊢ ◡(𝐴 × 𝐴) = (𝐴 × 𝐴)
4		xpidtr 6016	. . 3 ⊢ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴)) ⊆ (𝐴 × 𝐴)
5		uneq1 4086	. . . 4 ⊢ (◡(𝐴 × 𝐴) = (𝐴 × 𝐴) → (◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)))
6		unss2 4111	. . . 4 ⊢ (((𝐴 × 𝐴) ∘ (𝐴 × 𝐴)) ⊆ (𝐴 × 𝐴) → (◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)))
7		unidm 4082	. . . . 5 ⊢ ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = (𝐴 × 𝐴)
8		eqtr 2761	. . . . . 6 ⊢ (((◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) ∧ ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = (𝐴 × 𝐴)) → (◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = (𝐴 × 𝐴))
9		sseq2 3943	. . . . . . 7 ⊢ ((◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = (𝐴 × 𝐴) → ((◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) ↔ (◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (𝐴 × 𝐴)))
10	9	biimpd 228	. . . . . 6 ⊢ ((◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = (𝐴 × 𝐴) → ((◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) → (◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (𝐴 × 𝐴)))
11	8, 10	syl 17	. . . . 5 ⊢ (((◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) ∧ ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = (𝐴 × 𝐴)) → ((◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) → (◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (𝐴 × 𝐴)))
12	7, 11	mpan2 687	. . . 4 ⊢ ((◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) → ((◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) → (◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (𝐴 × 𝐴)))
13	5, 6, 12	syl2im 40	. . 3 ⊢ (◡(𝐴 × 𝐴) = (𝐴 × 𝐴) → (((𝐴 × 𝐴) ∘ (𝐴 × 𝐴)) ⊆ (𝐴 × 𝐴) → (◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (𝐴 × 𝐴)))
14	3, 4, 13	mp2 9	. 2 ⊢ (◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (𝐴 × 𝐴)
15		df-er 8456	. 2 ⊢ ((𝐴 × 𝐴) Er 𝐴 ↔ (Rel (𝐴 × 𝐴) ∧ dom (𝐴 × 𝐴) = 𝐴 ∧ (◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (𝐴 × 𝐴)))
16	1, 2, 14, 15	mpbir3an 1339	1 ⊢ (𝐴 × 𝐴) Er 𝐴

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1539   ∪ cun 3881   ⊆ wss 3883   × cxp 5578  ^◡ccnv 5579  dom cdm 5580   ∘ ccom 5584  Rel wrel 5585   Er wer 8453

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-br 5071  df-opab 5133  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-er 8456

This theorem is referenced by:  riiner  8537  efglem  19237