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

Theorem erinxp 6696
Description: A restricted equivalence relation is an equivalence relation. (Contributed by Mario Carneiro, 10-Jul-2015.) (Revised by Mario Carneiro, 12-Aug-2015.)
Hypotheses
Ref Expression
erinxp.r  |-  ( ph  ->  R  Er  A )
erinxp.a  |-  ( ph  ->  B  C_  A )
Assertion
Ref Expression
erinxp  |-  ( ph  ->  ( R  i^i  ( B  X.  B ) )  Er  B )

Proof of Theorem erinxp
Dummy variables  x  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 inss2 3394 . . . 4  |-  ( R  i^i  ( B  X.  B ) )  C_  ( B  X.  B
)
2 relxp 4784 . . . 4  |-  Rel  ( B  X.  B )
3 relss 4762 . . . 4  |-  ( ( R  i^i  ( B  X.  B ) ) 
C_  ( B  X.  B )  ->  ( Rel  ( B  X.  B
)  ->  Rel  ( R  i^i  ( B  X.  B ) ) ) )
41, 2, 3mp2 16 . . 3  |-  Rel  ( R  i^i  ( B  X.  B ) )
54a1i 9 . 2  |-  ( ph  ->  Rel  ( R  i^i  ( B  X.  B
) ) )
6 simpr 110 . . . . 5  |-  ( (
ph  /\  x ( R  i^i  ( B  X.  B ) ) y )  ->  x ( R  i^i  ( B  X.  B ) ) y )
7 brinxp2 4742 . . . . 5  |-  ( x ( R  i^i  ( B  X.  B ) ) y  <->  ( x  e.  B  /\  y  e.  B  /\  x R y ) )
86, 7sylib 122 . . . 4  |-  ( (
ph  /\  x ( R  i^i  ( B  X.  B ) ) y )  ->  ( x  e.  B  /\  y  e.  B  /\  x R y ) )
98simp2d 1013 . . 3  |-  ( (
ph  /\  x ( R  i^i  ( B  X.  B ) ) y )  ->  y  e.  B )
108simp1d 1012 . . 3  |-  ( (
ph  /\  x ( R  i^i  ( B  X.  B ) ) y )  ->  x  e.  B )
11 erinxp.r . . . . 5  |-  ( ph  ->  R  Er  A )
1211adantr 276 . . . 4  |-  ( (
ph  /\  x ( R  i^i  ( B  X.  B ) ) y )  ->  R  Er  A )
138simp3d 1014 . . . 4  |-  ( (
ph  /\  x ( R  i^i  ( B  X.  B ) ) y )  ->  x R
y )
1412, 13ersym 6632 . . 3  |-  ( (
ph  /\  x ( R  i^i  ( B  X.  B ) ) y )  ->  y R x )
15 brinxp2 4742 . . 3  |-  ( y ( R  i^i  ( B  X.  B ) ) x  <->  ( y  e.  B  /\  x  e.  B  /\  y R x ) )
169, 10, 14, 15syl3anbrc 1184 . 2  |-  ( (
ph  /\  x ( R  i^i  ( B  X.  B ) ) y )  ->  y ( R  i^i  ( B  X.  B ) ) x )
1710adantrr 479 . . 3  |-  ( (
ph  /\  ( x
( R  i^i  ( B  X.  B ) ) y  /\  y ( R  i^i  ( B  X.  B ) ) z ) )  ->  x  e.  B )
18 simprr 531 . . . . 5  |-  ( (
ph  /\  ( x
( R  i^i  ( B  X.  B ) ) y  /\  y ( R  i^i  ( B  X.  B ) ) z ) )  -> 
y ( R  i^i  ( B  X.  B
) ) z )
19 brinxp2 4742 . . . . 5  |-  ( y ( R  i^i  ( B  X.  B ) ) z  <->  ( y  e.  B  /\  z  e.  B  /\  y R z ) )
2018, 19sylib 122 . . . 4  |-  ( (
ph  /\  ( x
( R  i^i  ( B  X.  B ) ) y  /\  y ( R  i^i  ( B  X.  B ) ) z ) )  -> 
( y  e.  B  /\  z  e.  B  /\  y R z ) )
2120simp2d 1013 . . 3  |-  ( (
ph  /\  ( x
( R  i^i  ( B  X.  B ) ) y  /\  y ( R  i^i  ( B  X.  B ) ) z ) )  -> 
z  e.  B )
2211adantr 276 . . . 4  |-  ( (
ph  /\  ( x
( R  i^i  ( B  X.  B ) ) y  /\  y ( R  i^i  ( B  X.  B ) ) z ) )  ->  R  Er  A )
2313adantrr 479 . . . 4  |-  ( (
ph  /\  ( x
( R  i^i  ( B  X.  B ) ) y  /\  y ( R  i^i  ( B  X.  B ) ) z ) )  ->  x R y )
2420simp3d 1014 . . . 4  |-  ( (
ph  /\  ( x
( R  i^i  ( B  X.  B ) ) y  /\  y ( R  i^i  ( B  X.  B ) ) z ) )  -> 
y R z )
2522, 23, 24ertrd 6636 . . 3  |-  ( (
ph  /\  ( x
( R  i^i  ( B  X.  B ) ) y  /\  y ( R  i^i  ( B  X.  B ) ) z ) )  ->  x R z )
26 brinxp2 4742 . . 3  |-  ( x ( R  i^i  ( B  X.  B ) ) z  <->  ( x  e.  B  /\  z  e.  B  /\  x R z ) )
2717, 21, 25, 26syl3anbrc 1184 . 2  |-  ( (
ph  /\  ( x
( R  i^i  ( B  X.  B ) ) y  /\  y ( R  i^i  ( B  X.  B ) ) z ) )  ->  x ( R  i^i  ( B  X.  B
) ) z )
2811adantr 276 . . . . . 6  |-  ( (
ph  /\  x  e.  B )  ->  R  Er  A )
29 erinxp.a . . . . . . 7  |-  ( ph  ->  B  C_  A )
3029sselda 3193 . . . . . 6  |-  ( (
ph  /\  x  e.  B )  ->  x  e.  A )
3128, 30erref 6640 . . . . 5  |-  ( (
ph  /\  x  e.  B )  ->  x R x )
3231ex 115 . . . 4  |-  ( ph  ->  ( x  e.  B  ->  x R x ) )
3332pm4.71rd 394 . . 3  |-  ( ph  ->  ( x  e.  B  <->  ( x R x  /\  x  e.  B )
) )
34 brin 4096 . . . 4  |-  ( x ( R  i^i  ( B  X.  B ) ) x  <->  ( x R x  /\  x ( B  X.  B ) x ) )
35 brxp 4706 . . . . . 6  |-  ( x ( B  X.  B
) x  <->  ( x  e.  B  /\  x  e.  B ) )
36 anidm 396 . . . . . 6  |-  ( ( x  e.  B  /\  x  e.  B )  <->  x  e.  B )
3735, 36bitri 184 . . . . 5  |-  ( x ( B  X.  B
) x  <->  x  e.  B )
3837anbi2i 457 . . . 4  |-  ( ( x R x  /\  x ( B  X.  B ) x )  <-> 
( x R x  /\  x  e.  B
) )
3934, 38bitri 184 . . 3  |-  ( x ( R  i^i  ( B  X.  B ) ) x  <->  ( x R x  /\  x  e.  B ) )
4033, 39bitr4di 198 . 2  |-  ( ph  ->  ( x  e.  B  <->  x ( R  i^i  ( B  X.  B ) ) x ) )
415, 16, 27, 40iserd 6646 1  |-  ( ph  ->  ( R  i^i  ( B  X.  B ) )  Er  B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 981    e. wcel 2176    i^i cin 3165    C_ wss 3166   class class class wbr 4044    X. cxp 4673   Rel wrel 4680    Er wer 6617
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 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-14 2179  ax-ext 2187  ax-sep 4162  ax-pow 4218  ax-pr 4253
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-v 2774  df-un 3170  df-in 3172  df-ss 3179  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-br 4045  df-opab 4106  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-er 6620
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator