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

Theorem xpiderm 6361
Description: A square Cartesian product is an equivalence relation (in general it's not a poset). (Contributed by Jim Kingdon, 22-Aug-2019.)
Assertion
Ref Expression
xpiderm  |-  ( E. x  x  e.  A  ->  ( A  X.  A
)  Er  A )
Distinct variable group:    x, A

Proof of Theorem xpiderm
StepHypRef Expression
1 relxp 4547 . . 3  |-  Rel  ( A  X.  A )
21a1i 9 . 2  |-  ( E. x  x  e.  A  ->  Rel  ( A  X.  A ) )
3 dmxpm 4656 . 2  |-  ( E. x  x  e.  A  ->  dom  ( A  X.  A )  =  A )
4 cnvxp 4850 . . . 4  |-  `' ( A  X.  A )  =  ( A  X.  A )
5 xpidtr 4822 . . . 4  |-  ( ( A  X.  A )  o.  ( A  X.  A ) )  C_  ( A  X.  A
)
6 uneq1 3147 . . . . 5  |-  ( `' ( A  X.  A
)  =  ( A  X.  A )  -> 
( `' ( A  X.  A )  u.  ( A  X.  A
) )  =  ( ( A  X.  A
)  u.  ( A  X.  A ) ) )
7 unss2 3171 . . . . 5  |-  ( ( ( A  X.  A
)  o.  ( A  X.  A ) ) 
C_  ( A  X.  A )  ->  ( `' ( A  X.  A )  u.  (
( A  X.  A
)  o.  ( A  X.  A ) ) )  C_  ( `' ( A  X.  A
)  u.  ( A  X.  A ) ) )
8 unidm 3143 . . . . . 6  |-  ( ( A  X.  A )  u.  ( A  X.  A ) )  =  ( A  X.  A
)
9 eqtr 2105 . . . . . . 7  |-  ( ( ( `' ( A  X.  A )  u.  ( A  X.  A
) )  =  ( ( A  X.  A
)  u.  ( A  X.  A ) )  /\  ( ( A  X.  A )  u.  ( A  X.  A
) )  =  ( A  X.  A ) )  ->  ( `' ( A  X.  A
)  u.  ( A  X.  A ) )  =  ( A  X.  A ) )
10 sseq2 3048 . . . . . . . 8  |-  ( ( `' ( A  X.  A )  u.  ( A  X.  A ) )  =  ( A  X.  A )  ->  (
( `' ( A  X.  A )  u.  ( ( A  X.  A )  o.  ( A  X.  A ) ) )  C_  ( `' ( A  X.  A
)  u.  ( A  X.  A ) )  <-> 
( `' ( A  X.  A )  u.  ( ( A  X.  A )  o.  ( A  X.  A ) ) )  C_  ( A  X.  A ) ) )
1110biimpd 142 . . . . . . 7  |-  ( ( `' ( A  X.  A )  u.  ( A  X.  A ) )  =  ( A  X.  A )  ->  (
( `' ( A  X.  A )  u.  ( ( A  X.  A )  o.  ( A  X.  A ) ) )  C_  ( `' ( A  X.  A
)  u.  ( A  X.  A ) )  ->  ( `' ( A  X.  A )  u.  ( ( A  X.  A )  o.  ( A  X.  A
) ) )  C_  ( A  X.  A
) ) )
129, 11syl 14 . . . . . 6  |-  ( ( ( `' ( A  X.  A )  u.  ( A  X.  A
) )  =  ( ( A  X.  A
)  u.  ( A  X.  A ) )  /\  ( ( A  X.  A )  u.  ( A  X.  A
) )  =  ( A  X.  A ) )  ->  ( ( `' ( A  X.  A )  u.  (
( A  X.  A
)  o.  ( A  X.  A ) ) )  C_  ( `' ( A  X.  A
)  u.  ( A  X.  A ) )  ->  ( `' ( A  X.  A )  u.  ( ( A  X.  A )  o.  ( A  X.  A
) ) )  C_  ( A  X.  A
) ) )
138, 12mpan2 416 . . . . 5  |-  ( ( `' ( A  X.  A )  u.  ( A  X.  A ) )  =  ( ( A  X.  A )  u.  ( A  X.  A
) )  ->  (
( `' ( A  X.  A )  u.  ( ( A  X.  A )  o.  ( A  X.  A ) ) )  C_  ( `' ( A  X.  A
)  u.  ( A  X.  A ) )  ->  ( `' ( A  X.  A )  u.  ( ( A  X.  A )  o.  ( A  X.  A
) ) )  C_  ( A  X.  A
) ) )
146, 7, 13syl2im 38 . . . 4  |-  ( `' ( A  X.  A
)  =  ( A  X.  A )  -> 
( ( ( A  X.  A )  o.  ( A  X.  A
) )  C_  ( A  X.  A )  -> 
( `' ( A  X.  A )  u.  ( ( A  X.  A )  o.  ( A  X.  A ) ) )  C_  ( A  X.  A ) ) )
154, 5, 14mp2 16 . . 3  |-  ( `' ( A  X.  A
)  u.  ( ( A  X.  A )  o.  ( A  X.  A ) ) ) 
C_  ( A  X.  A )
1615a1i 9 . 2  |-  ( E. x  x  e.  A  ->  ( `' ( A  X.  A )  u.  ( ( A  X.  A )  o.  ( A  X.  A ) ) )  C_  ( A  X.  A ) )
17 df-er 6290 . 2  |-  ( ( A  X.  A )  Er  A  <->  ( Rel  ( A  X.  A
)  /\  dom  ( A  X.  A )  =  A  /\  ( `' ( A  X.  A
)  u.  ( ( A  X.  A )  o.  ( A  X.  A ) ) ) 
C_  ( A  X.  A ) ) )
182, 3, 16, 17syl3anbrc 1127 1  |-  ( E. x  x  e.  A  ->  ( A  X.  A
)  Er  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    = wceq 1289   E.wex 1426    e. wcel 1438    u. cun 2997    C_ wss 2999    X. cxp 4436   `'ccnv 4437   dom cdm 4438    o. ccom 4442   Rel wrel 4443    Er wer 6287
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-14 1450  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070  ax-sep 3957  ax-pow 4009  ax-pr 4036
This theorem depends on definitions:  df-bi 115  df-3an 926  df-tru 1292  df-nf 1395  df-sb 1693  df-eu 1951  df-mo 1952  df-clab 2075  df-cleq 2081  df-clel 2084  df-nfc 2217  df-ral 2364  df-rex 2365  df-v 2621  df-un 3003  df-in 3005  df-ss 3012  df-pw 3431  df-sn 3452  df-pr 3453  df-op 3455  df-br 3846  df-opab 3900  df-xp 4444  df-rel 4445  df-cnv 4446  df-co 4447  df-dm 4448  df-er 6290
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator