ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  xpider GIF version

Theorem xpider 6700
Description: A square Cartesian product is an equivalence relation (in general it's 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
StepHypRef Expression
1 relxp 4788 . 2 Rel (𝐴 × 𝐴)
2 dmxpid 4904 . 2 dom (𝐴 × 𝐴) = 𝐴
3 cnvxp 5106 . . 3 (𝐴 × 𝐴) = (𝐴 × 𝐴)
4 xpidtr 5078 . . 3 ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴)) ⊆ (𝐴 × 𝐴)
5 uneq1 3321 . . . 4 ((𝐴 × 𝐴) = (𝐴 × 𝐴) → ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)))
6 unss2 3345 . . . 4 (((𝐴 × 𝐴) ∘ (𝐴 × 𝐴)) ⊆ (𝐴 × 𝐴) → ((𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)))
7 unidm 3317 . . . . 5 ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = (𝐴 × 𝐴)
8 eqtr 2224 . . . . . 6 ((((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) ∧ ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = (𝐴 × 𝐴)) → ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = (𝐴 × 𝐴))
9 sseq2 3218 . . . . . . 7 (((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = (𝐴 × 𝐴) → (((𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) ↔ ((𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (𝐴 × 𝐴)))
109biimpd 144 . . . . . 6 (((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = (𝐴 × 𝐴) → (((𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) → ((𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (𝐴 × 𝐴)))
118, 10syl 14 . . . . 5 ((((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) ∧ ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = (𝐴 × 𝐴)) → (((𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) → ((𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (𝐴 × 𝐴)))
127, 11mpan2 425 . . . 4 (((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) = ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) → (((𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ ((𝐴 × 𝐴) ∪ (𝐴 × 𝐴)) → ((𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (𝐴 × 𝐴)))
135, 6, 12syl2im 38 . . 3 ((𝐴 × 𝐴) = (𝐴 × 𝐴) → (((𝐴 × 𝐴) ∘ (𝐴 × 𝐴)) ⊆ (𝐴 × 𝐴) → ((𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (𝐴 × 𝐴)))
143, 4, 13mp2 16 . 2 ((𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (𝐴 × 𝐴)
15 df-er 6627 . 2 ((𝐴 × 𝐴) Er 𝐴 ↔ (Rel (𝐴 × 𝐴) ∧ dom (𝐴 × 𝐴) = 𝐴 ∧ ((𝐴 × 𝐴) ∪ ((𝐴 × 𝐴) ∘ (𝐴 × 𝐴))) ⊆ (𝐴 × 𝐴)))
161, 2, 14, 15mpbir3an 1182 1 (𝐴 × 𝐴) Er 𝐴
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1373  cun 3165  wss 3167   × cxp 4677  ccnv 4678  dom cdm 4679  ccom 4683  Rel wrel 4684   Er wer 6624
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2180  ax-ext 2188  ax-sep 4166  ax-pow 4222  ax-pr 4257
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ral 2490  df-rex 2491  df-v 2775  df-un 3171  df-in 3173  df-ss 3180  df-pw 3619  df-sn 3640  df-pr 3641  df-op 3643  df-br 4048  df-opab 4110  df-xp 4685  df-rel 4686  df-cnv 4687  df-co 4688  df-dm 4689  df-er 6627
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator