Theorem xpider 8577

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 5607	. 2 ⊢ Rel (𝐴 × 𝐴)
2		dmxpid 5839	. 2 ⊢ dom (𝐴 × 𝐴) = 𝐴
3		cnvxp 6060	. . 3 ⊢ ◡(𝐴 × 𝐴) = (𝐴 × 𝐴)
4		xpidtr 6027	. . 3 ⊢ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴)) ⊆ (𝐴 × 𝐴)
5		uneq1 4090	. . . 4 ⊢ (◡(𝐴 × 𝐴) = (𝐴 × 𝐴) → (◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)))
6		unss2 4115	. . . 4 ⊢ (((𝐴 × 𝐴) ∘ (𝐴 × 𝐴)) ⊆ (𝐴 × 𝐴) → (◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)))
7		unidm 4086	. . . . 5 ⊢ ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = (𝐴 × 𝐴)
8		eqtr 2761	. . . . . 6 ⊢ (((◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) ∧ ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = (𝐴 × 𝐴)) → (◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = (𝐴 × 𝐴))
9		sseq2 3947	. . . . . . 7 ⊢ ((◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = (𝐴 × 𝐴) → ((◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) ↔ (◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (𝐴 × 𝐴)))
10	9	biimpd 228	. . . . . 6 ⊢ ((◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = (𝐴 × 𝐴) → ((◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) → (◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (𝐴 × 𝐴)))
11	8, 10	syl 17	. . . . 5 ⊢ (((◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) ∧ ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = (𝐴 × 𝐴)) → ((◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) → (◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (𝐴 × 𝐴)))
12	7, 11	mpan2 688	. . . 4 ⊢ ((◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) → ((◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (◡(𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) → (◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (𝐴 × 𝐴)))
13	5, 6, 12	syl2im 40	. . 3 ⊢ (◡(𝐴 × 𝐴) = (𝐴 × 𝐴) → (((𝐴 × 𝐴) ∘ (𝐴 × 𝐴)) ⊆ (𝐴 × 𝐴) → (◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (𝐴 × 𝐴)))
14	3, 4, 13	mp2 9	. 2 ⊢ (◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (𝐴 × 𝐴)
15		df-er 8498	. 2 ⊢ ((𝐴 × 𝐴) Er 𝐴 ↔ (Rel (𝐴 × 𝐴) ∧ dom (𝐴 × 𝐴) = 𝐴 ∧ (◡(𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (𝐴 × 𝐴)))
16	1, 2, 14, 15	mpbir3an 1340	1 ⊢ (𝐴 × 𝐴) Er 𝐴

Syntax hints:   → wi 4   ∧ wa 396   = wceq 1539   ∪ cun 3885   ⊆ wss 3887   × cxp 5587  ^◡ccnv 5588  dom cdm 5589   ∘ ccom 5593  Rel wrel 5594   Er wer 8495

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-br 5075  df-opab 5137  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-er 8498

This theorem is referenced by:  riiner  8579  efglem  19322