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

Theorem ress0g 13024
Description:  0g is unaffected by restriction. This is a bit more generic than submnd0 13025. (Contributed by Thierry Arnoux, 23-Oct-2017.)
Hypotheses
Ref Expression
ress0g.s  |-  S  =  ( Rs  A )
ress0g.b  |-  B  =  ( Base `  R
)
ress0g.0  |-  .0.  =  ( 0g `  R )
Assertion
Ref Expression
ress0g  |-  ( ( R  e.  Mnd  /\  .0.  e.  A  /\  A  C_  B )  ->  .0.  =  ( 0g `  S ) )

Proof of Theorem ress0g
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 ress0g.s . . . 4  |-  S  =  ( Rs  A )
21a1i 9 . . 3  |-  ( ( R  e.  Mnd  /\  .0.  e.  A  /\  A  C_  B )  ->  S  =  ( Rs  A ) )
3 ress0g.b . . . 4  |-  B  =  ( Base `  R
)
43a1i 9 . . 3  |-  ( ( R  e.  Mnd  /\  .0.  e.  A  /\  A  C_  B )  ->  B  =  ( Base `  R
) )
5 simp1 999 . . 3  |-  ( ( R  e.  Mnd  /\  .0.  e.  A  /\  A  C_  B )  ->  R  e.  Mnd )
6 simp3 1001 . . 3  |-  ( ( R  e.  Mnd  /\  .0.  e.  A  /\  A  C_  B )  ->  A  C_  B )
72, 4, 5, 6ressbas2d 12686 . 2  |-  ( ( R  e.  Mnd  /\  .0.  e.  A  /\  A  C_  B )  ->  A  =  ( Base `  S
) )
8 eqidd 2194 . . 3  |-  ( ( R  e.  Mnd  /\  .0.  e.  A  /\  A  C_  B )  ->  ( +g  `  R )  =  ( +g  `  R
) )
9 basfn 12676 . . . . . 6  |-  Base  Fn  _V
105elexd 2773 . . . . . 6  |-  ( ( R  e.  Mnd  /\  .0.  e.  A  /\  A  C_  B )  ->  R  e.  _V )
11 funfvex 5571 . . . . . . 7  |-  ( ( Fun  Base  /\  R  e. 
dom  Base )  ->  ( Base `  R )  e. 
_V )
1211funfni 5354 . . . . . 6  |-  ( (
Base  Fn  _V  /\  R  e.  _V )  ->  ( Base `  R )  e. 
_V )
139, 10, 12sylancr 414 . . . . 5  |-  ( ( R  e.  Mnd  /\  .0.  e.  A  /\  A  C_  B )  ->  ( Base `  R )  e. 
_V )
143, 13eqeltrid 2280 . . . 4  |-  ( ( R  e.  Mnd  /\  .0.  e.  A  /\  A  C_  B )  ->  B  e.  _V )
1514, 6ssexd 4169 . . 3  |-  ( ( R  e.  Mnd  /\  .0.  e.  A  /\  A  C_  B )  ->  A  e.  _V )
162, 8, 15, 5ressplusgd 12746 . 2  |-  ( ( R  e.  Mnd  /\  .0.  e.  A  /\  A  C_  B )  ->  ( +g  `  R )  =  ( +g  `  S
) )
17 simp2 1000 . 2  |-  ( ( R  e.  Mnd  /\  .0.  e.  A  /\  A  C_  B )  ->  .0.  e.  A )
18 simpl1 1002 . . 3  |-  ( ( ( R  e.  Mnd  /\  .0.  e.  A  /\  A  C_  B )  /\  x  e.  A )  ->  R  e.  Mnd )
196sselda 3179 . . 3  |-  ( ( ( R  e.  Mnd  /\  .0.  e.  A  /\  A  C_  B )  /\  x  e.  A )  ->  x  e.  B )
20 eqid 2193 . . . 4  |-  ( +g  `  R )  =  ( +g  `  R )
21 ress0g.0 . . . 4  |-  .0.  =  ( 0g `  R )
223, 20, 21mndlid 13016 . . 3  |-  ( ( R  e.  Mnd  /\  x  e.  B )  ->  (  .0.  ( +g  `  R ) x )  =  x )
2318, 19, 22syl2anc 411 . 2  |-  ( ( ( R  e.  Mnd  /\  .0.  e.  A  /\  A  C_  B )  /\  x  e.  A )  ->  (  .0.  ( +g  `  R ) x )  =  x )
243, 20, 21mndrid 13017 . . 3  |-  ( ( R  e.  Mnd  /\  x  e.  B )  ->  ( x ( +g  `  R )  .0.  )  =  x )
2518, 19, 24syl2anc 411 . 2  |-  ( ( ( R  e.  Mnd  /\  .0.  e.  A  /\  A  C_  B )  /\  x  e.  A )  ->  ( x ( +g  `  R )  .0.  )  =  x )
267, 16, 17, 23, 25grpidd 12966 1  |-  ( ( R  e.  Mnd  /\  .0.  e.  A  /\  A  C_  B )  ->  .0.  =  ( 0g `  S ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 980    = wceq 1364    e. wcel 2164   _Vcvv 2760    C_ wss 3153    Fn wfn 5249   ` cfv 5254  (class class class)co 5918   Basecbs 12618   ↾s cress 12619   +g cplusg 12695   0gc0g 12867   Mndcmnd 12997
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-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-cnex 7963  ax-resscn 7964  ax-1cn 7965  ax-1re 7966  ax-icn 7967  ax-addcl 7968  ax-addrcl 7969  ax-mulcl 7970  ax-addcom 7972  ax-addass 7974  ax-i2m1 7977  ax-0lt1 7978  ax-0id 7980  ax-rnegex 7981  ax-pre-ltirr 7984  ax-pre-ltadd 7988
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-iota 5215  df-fun 5256  df-fn 5257  df-fv 5262  df-riota 5873  df-ov 5921  df-oprab 5922  df-mpo 5923  df-pnf 8056  df-mnf 8057  df-ltxr 8059  df-inn 8983  df-2 9041  df-ndx 12621  df-slot 12622  df-base 12624  df-sets 12625  df-iress 12626  df-plusg 12708  df-0g 12869  df-mgm 12939  df-sgrp 12985  df-mnd 12998
This theorem is referenced by:  submnd0  13025  zring0  14088
  Copyright terms: Public domain W3C validator