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

Theorem 0g0 12800
Description: The identity element function evaluates to the empty set on an empty structure. (Contributed by Stefan O'Rear, 2-Oct-2015.)
Assertion
Ref Expression
0g0  |-  (/)  =  ( 0g `  (/) )

Proof of Theorem 0g0
Dummy variables  e  x are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 0ex 4132 . . 3  |-  (/)  e.  _V
2 base0 12514 . . . 4  |-  (/)  =  (
Base `  (/) )
3 eqid 2177 . . . 4  |-  ( +g  `  (/) )  =  ( +g  `  (/) )
4 eqid 2177 . . . 4  |-  ( 0g
`  (/) )  =  ( 0g `  (/) )
52, 3, 4grpidvalg 12797 . . 3  |-  ( (/)  e.  _V  ->  ( 0g `  (/) )  =  ( iota e ( e  e.  (/)  /\  A. x  e.  (/)  ( ( e ( +g  `  (/) ) x )  =  x  /\  ( x ( +g  `  (/) ) e )  =  x ) ) ) )
61, 5ax-mp 5 . 2  |-  ( 0g
`  (/) )  =  ( iota e ( e  e.  (/)  /\  A. x  e.  (/)  ( ( e ( +g  `  (/) ) x )  =  x  /\  ( x ( +g  `  (/) ) e )  =  x ) ) )
7 noel 3428 . . . . . 6  |-  -.  e  e.  (/)
87intnanr 930 . . . . 5  |-  -.  (
e  e.  (/)  /\  A. x  e.  (/)  ( ( e ( +g  `  (/) ) x )  =  x  /\  ( x ( +g  `  (/) ) e )  =  x ) )
98nex 1500 . . . 4  |-  -.  E. e ( e  e.  (/)  /\  A. x  e.  (/)  ( ( e ( +g  `  (/) ) x )  =  x  /\  ( x ( +g  `  (/) ) e )  =  x ) )
10 euex 2056 . . . 4  |-  ( E! e ( e  e.  (/)  /\  A. x  e.  (/)  ( ( e ( +g  `  (/) ) x )  =  x  /\  ( x ( +g  `  (/) ) e )  =  x ) )  ->  E. e ( e  e.  (/)  /\  A. x  e.  (/)  ( ( e ( +g  `  (/) ) x )  =  x  /\  ( x ( +g  `  (/) ) e )  =  x ) ) )
119, 10mto 662 . . 3  |-  -.  E! e ( e  e.  (/)  /\  A. x  e.  (/)  ( ( e ( +g  `  (/) ) x )  =  x  /\  ( x ( +g  `  (/) ) e )  =  x ) )
12 iotanul 5195 . . 3  |-  ( -.  E! e ( e  e.  (/)  /\  A. x  e.  (/)  ( ( e ( +g  `  (/) ) x )  =  x  /\  ( x ( +g  `  (/) ) e )  =  x ) )  -> 
( iota e ( e  e.  (/)  /\  A. x  e.  (/)  ( ( e ( +g  `  (/) ) x )  =  x  /\  ( x ( +g  `  (/) ) e )  =  x ) ) )  =  (/) )
1311, 12ax-mp 5 . 2  |-  ( iota e ( e  e.  (/)  /\  A. x  e.  (/)  ( ( e ( +g  `  (/) ) x )  =  x  /\  ( x ( +g  `  (/) ) e )  =  x ) ) )  =  (/)
146, 13eqtr2i 2199 1  |-  (/)  =  ( 0g `  (/) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    /\ wa 104    = wceq 1353   E.wex 1492   E!weu 2026    e. wcel 2148   A.wral 2455   _Vcvv 2739   (/)c0 3424   iotacio 5178   ` cfv 5218  (class class class)co 5877   +g cplusg 12538   0gc0g 12710
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-nul 4131  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-cnex 7904  ax-resscn 7905  ax-1re 7907  ax-addrcl 7910
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2741  df-sbc 2965  df-csb 3060  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-nul 3425  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-int 3847  df-br 4006  df-opab 4067  df-mpt 4068  df-id 4295  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-iota 5180  df-fun 5220  df-fn 5221  df-fv 5226  df-riota 5833  df-ov 5880  df-inn 8922  df-ndx 12467  df-slot 12468  df-base 12470  df-0g 12712
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator