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

Theorem erinxp 6587
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 3348 . . . 4  |-  ( R  i^i  ( B  X.  B ) )  C_  ( B  X.  B
)
2 relxp 4720 . . . 4  |-  Rel  ( B  X.  B )
3 relss 4698 . . . 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 109 . . . . 5  |-  ( (
ph  /\  x ( R  i^i  ( B  X.  B ) ) y )  ->  x ( R  i^i  ( B  X.  B ) ) y )
7 brinxp2 4678 . . . . 5  |-  ( x ( R  i^i  ( B  X.  B ) ) y  <->  ( x  e.  B  /\  y  e.  B  /\  x R y ) )
86, 7sylib 121 . . . 4  |-  ( (
ph  /\  x ( R  i^i  ( B  X.  B ) ) y )  ->  ( x  e.  B  /\  y  e.  B  /\  x R y ) )
98simp2d 1005 . . 3  |-  ( (
ph  /\  x ( R  i^i  ( B  X.  B ) ) y )  ->  y  e.  B )
108simp1d 1004 . . 3  |-  ( (
ph  /\  x ( R  i^i  ( B  X.  B ) ) y )  ->  x  e.  B )
11 erinxp.r . . . . 5  |-  ( ph  ->  R  Er  A )
1211adantr 274 . . . 4  |-  ( (
ph  /\  x ( R  i^i  ( B  X.  B ) ) y )  ->  R  Er  A )
138simp3d 1006 . . . 4  |-  ( (
ph  /\  x ( R  i^i  ( B  X.  B ) ) y )  ->  x R
y )
1412, 13ersym 6525 . . 3  |-  ( (
ph  /\  x ( R  i^i  ( B  X.  B ) ) y )  ->  y R x )
15 brinxp2 4678 . . 3  |-  ( y ( R  i^i  ( B  X.  B ) ) x  <->  ( y  e.  B  /\  x  e.  B  /\  y R x ) )
169, 10, 14, 15syl3anbrc 1176 . 2  |-  ( (
ph  /\  x ( R  i^i  ( B  X.  B ) ) y )  ->  y ( R  i^i  ( B  X.  B ) ) x )
1710adantrr 476 . . 3  |-  ( (
ph  /\  ( x
( R  i^i  ( B  X.  B ) ) y  /\  y ( R  i^i  ( B  X.  B ) ) z ) )  ->  x  e.  B )
18 simprr 527 . . . . 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 4678 . . . . 5  |-  ( y ( R  i^i  ( B  X.  B ) ) z  <->  ( y  e.  B  /\  z  e.  B  /\  y R z ) )
2018, 19sylib 121 . . . 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 1005 . . 3  |-  ( (
ph  /\  ( x
( R  i^i  ( B  X.  B ) ) y  /\  y ( R  i^i  ( B  X.  B ) ) z ) )  -> 
z  e.  B )
2211adantr 274 . . . 4  |-  ( (
ph  /\  ( x
( R  i^i  ( B  X.  B ) ) y  /\  y ( R  i^i  ( B  X.  B ) ) z ) )  ->  R  Er  A )
2313adantrr 476 . . . 4  |-  ( (
ph  /\  ( x
( R  i^i  ( B  X.  B ) ) y  /\  y ( R  i^i  ( B  X.  B ) ) z ) )  ->  x R y )
2420simp3d 1006 . . . 4  |-  ( (
ph  /\  ( x
( R  i^i  ( B  X.  B ) ) y  /\  y ( R  i^i  ( B  X.  B ) ) z ) )  -> 
y R z )
2522, 23, 24ertrd 6529 . . 3  |-  ( (
ph  /\  ( x
( R  i^i  ( B  X.  B ) ) y  /\  y ( R  i^i  ( B  X.  B ) ) z ) )  ->  x R z )
26 brinxp2 4678 . . 3  |-  ( x ( R  i^i  ( B  X.  B ) ) z  <->  ( x  e.  B  /\  z  e.  B  /\  x R z ) )
2717, 21, 25, 26syl3anbrc 1176 . 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 274 . . . . . 6  |-  ( (
ph  /\  x  e.  B )  ->  R  Er  A )
29 erinxp.a . . . . . . 7  |-  ( ph  ->  B  C_  A )
3029sselda 3147 . . . . . 6  |-  ( (
ph  /\  x  e.  B )  ->  x  e.  A )
3128, 30erref 6533 . . . . 5  |-  ( (
ph  /\  x  e.  B )  ->  x R x )
3231ex 114 . . . 4  |-  ( ph  ->  ( x  e.  B  ->  x R x ) )
3332pm4.71rd 392 . . 3  |-  ( ph  ->  ( x  e.  B  <->  ( x R x  /\  x  e.  B )
) )
34 brin 4041 . . . 4  |-  ( x ( R  i^i  ( B  X.  B ) ) x  <->  ( x R x  /\  x ( B  X.  B ) x ) )
35 brxp 4642 . . . . . 6  |-  ( x ( B  X.  B
) x  <->  ( x  e.  B  /\  x  e.  B ) )
36 anidm 394 . . . . . 6  |-  ( ( x  e.  B  /\  x  e.  B )  <->  x  e.  B )
3735, 36bitri 183 . . . . 5  |-  ( x ( B  X.  B
) x  <->  x  e.  B )
3837anbi2i 454 . . . 4  |-  ( ( x R x  /\  x ( B  X.  B ) x )  <-> 
( x R x  /\  x  e.  B
) )
3934, 38bitri 183 . . 3  |-  ( x ( R  i^i  ( B  X.  B ) ) x  <->  ( x R x  /\  x  e.  B ) )
4033, 39bitr4di 197 . 2  |-  ( ph  ->  ( x  e.  B  <->  x ( R  i^i  ( B  X.  B ) ) x ) )
415, 16, 27, 40iserd 6539 1  |-  ( ph  ->  ( R  i^i  ( B  X.  B ) )  Er  B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    /\ w3a 973    e. wcel 2141    i^i cin 3120    C_ wss 3121   class class class wbr 3989    X. cxp 4609   Rel wrel 4616    Er wer 6510
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-br 3990  df-opab 4051  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-er 6513
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator