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

Theorem setsn0fun 12984
Description: The value of the structure replacement function (without the empty set) is a function if the structure (without the empty set) is a function. (Contributed by AV, 7-Jun-2021.) (Revised by AV, 16-Nov-2021.)
Hypotheses
Ref Expression
setsn0fun.s  |-  ( ph  ->  S Struct  X )
setsn0fun.i  |-  ( ph  ->  I  e.  U )
setsn0fun.e  |-  ( ph  ->  E  e.  W )
Assertion
Ref Expression
setsn0fun  |-  ( ph  ->  Fun  ( ( S sSet  <. I ,  E >. ) 
\  { (/) } ) )

Proof of Theorem setsn0fun
StepHypRef Expression
1 setsn0fun.s . 2  |-  ( ph  ->  S Struct  X )
2 structn0fun 12960 . . 3  |-  ( S Struct  X  ->  Fun  ( S  \  { (/) } ) )
3 setsn0fun.i . . . . 5  |-  ( ph  ->  I  e.  U )
4 setsn0fun.e . . . . 5  |-  ( ph  ->  E  e.  W )
5 structex 12959 . . . . . . 7  |-  ( S Struct  X  ->  S  e.  _V )
6 setsfun0 12983 . . . . . . 7  |-  ( ( ( S  e.  _V  /\ 
Fun  ( S  \  { (/) } ) )  /\  ( I  e.  U  /\  E  e.  W ) )  ->  Fun  ( ( S sSet  <. I ,  E >. )  \  { (/) } ) )
75, 6sylanl1 402 . . . . . 6  |-  ( ( ( S Struct  X  /\  Fun  ( S  \  { (/)
} ) )  /\  ( I  e.  U  /\  E  e.  W
) )  ->  Fun  ( ( S sSet  <. I ,  E >. )  \  { (/) } ) )
87expcom 116 . . . . 5  |-  ( ( I  e.  U  /\  E  e.  W )  ->  ( ( S Struct  X  /\  Fun  ( S  \  { (/) } ) )  ->  Fun  ( ( S sSet  <. I ,  E >. )  \  { (/) } ) ) )
93, 4, 8syl2anc 411 . . . 4  |-  ( ph  ->  ( ( S Struct  X  /\  Fun  ( S  \  { (/) } ) )  ->  Fun  ( ( S sSet  <. I ,  E >. )  \  { (/) } ) ) )
109com12 30 . . 3  |-  ( ( S Struct  X  /\  Fun  ( S  \  { (/) } ) )  ->  ( ph  ->  Fun  ( ( S sSet  <. I ,  E >. ) 
\  { (/) } ) ) )
112, 10mpdan 421 . 2  |-  ( S Struct  X  ->  ( ph  ->  Fun  ( ( S sSet  <. I ,  E >. )  \  { (/) } ) ) )
121, 11mpcom 36 1  |-  ( ph  ->  Fun  ( ( S sSet  <. I ,  E >. ) 
\  { (/) } ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    e. wcel 2178   _Vcvv 2776    \ cdif 3171   (/)c0 3468   {csn 3643   <.cop 3646   class class class wbr 4059   Fun wfun 5284  (class class class)co 5967   Struct cstr 12943   sSet csts 12945
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-ral 2491  df-rex 2492  df-rab 2495  df-v 2778  df-sbc 3006  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-nul 3469  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-br 4060  df-opab 4122  df-id 4358  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-res 4705  df-iota 5251  df-fun 5292  df-fv 5298  df-ov 5970  df-oprab 5971  df-mpo 5972  df-struct 12949  df-sets 12954
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator