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

Theorem ecinxp 6822
Description: Restrict the relation in an equivalence class to a base set. (Contributed by Mario Carneiro, 10-Jul-2015.)
Assertion
Ref Expression
ecinxp  |-  ( ( ( R " A
)  C_  A  /\  B  e.  A )  ->  [ B ] R  =  [ B ] ( R  i^i  ( A  X.  A ) ) )

Proof of Theorem ecinxp
StepHypRef Expression
1 simpr 110 . . . . . . . 8  |-  ( ( ( R " A
)  C_  A  /\  B  e.  A )  ->  B  e.  A )
21snssd 3823 . . . . . . 7  |-  ( ( ( R " A
)  C_  A  /\  B  e.  A )  ->  { B }  C_  A )
3 df-ss 3214 . . . . . . 7  |-  ( { B }  C_  A  <->  ( { B }  i^i  A )  =  { B } )
42, 3sylib 122 . . . . . 6  |-  ( ( ( R " A
)  C_  A  /\  B  e.  A )  ->  ( { B }  i^i  A )  =  { B } )
54imaeq2d 5082 . . . . 5  |-  ( ( ( R " A
)  C_  A  /\  B  e.  A )  ->  ( R " ( { B }  i^i  A
) )  =  ( R " { B } ) )
65ineq1d 3409 . . . 4  |-  ( ( ( R " A
)  C_  A  /\  B  e.  A )  ->  ( ( R "
( { B }  i^i  A ) )  i^i 
A )  =  ( ( R " { B } )  i^i  A
) )
7 imass2 5119 . . . . . . 7  |-  ( { B }  C_  A  ->  ( R " { B } )  C_  ( R " A ) )
82, 7syl 14 . . . . . 6  |-  ( ( ( R " A
)  C_  A  /\  B  e.  A )  ->  ( R " { B } )  C_  ( R " A ) )
9 simpl 109 . . . . . 6  |-  ( ( ( R " A
)  C_  A  /\  B  e.  A )  ->  ( R " A
)  C_  A )
108, 9sstrd 3238 . . . . 5  |-  ( ( ( R " A
)  C_  A  /\  B  e.  A )  ->  ( R " { B } )  C_  A
)
11 df-ss 3214 . . . . 5  |-  ( ( R " { B } )  C_  A  <->  ( ( R " { B } )  i^i  A
)  =  ( R
" { B }
) )
1210, 11sylib 122 . . . 4  |-  ( ( ( R " A
)  C_  A  /\  B  e.  A )  ->  ( ( R " { B } )  i^i 
A )  =  ( R " { B } ) )
136, 12eqtr2d 2265 . . 3  |-  ( ( ( R " A
)  C_  A  /\  B  e.  A )  ->  ( R " { B } )  =  ( ( R " ( { B }  i^i  A
) )  i^i  A
) )
14 imainrect 5189 . . 3  |-  ( ( R  i^i  ( A  X.  A ) )
" { B }
)  =  ( ( R " ( { B }  i^i  A
) )  i^i  A
)
1513, 14eqtr4di 2282 . 2  |-  ( ( ( R " A
)  C_  A  /\  B  e.  A )  ->  ( R " { B } )  =  ( ( R  i^i  ( A  X.  A ) )
" { B }
) )
16 df-ec 6747 . 2  |-  [ B ] R  =  ( R " { B }
)
17 df-ec 6747 . 2  |-  [ B ] ( R  i^i  ( A  X.  A
) )  =  ( ( R  i^i  ( A  X.  A ) )
" { B }
)
1815, 16, 173eqtr4g 2289 1  |-  ( ( ( R " A
)  C_  A  /\  B  e.  A )  ->  [ B ] R  =  [ B ] ( R  i^i  ( A  X.  A ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398    e. wcel 2202    i^i cin 3200    C_ wss 3201   {csn 3673    X. cxp 4729   "cima 4734   [cec 6743
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-br 4094  df-opab 4156  df-xp 4737  df-rel 4738  df-cnv 4739  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-ec 6747
This theorem is referenced by:  qsinxp  6823  nqnq0pi  7701  qusin  13472
  Copyright terms: Public domain W3C validator