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

Theorem structiedg0val 15856
Description: The set of indexed edges of an extensible structure with a base set and another slot not being the slot for edge functions is empty. (Contributed by AV, 23-Sep-2020.) (Proof shortened by AV, 12-Nov-2021.)
Hypotheses
Ref Expression
structvtxvallem.s  |-  S  e.  NN
structvtxvallem.b  |-  ( Base `  ndx )  <  S
structvtxvallem.g  |-  G  =  { <. ( Base `  ndx ) ,  V >. , 
<. S ,  E >. }
Assertion
Ref Expression
structiedg0val  |-  ( ( V  e.  X  /\  E  e.  Y  /\  S  =/=  (.ef `  ndx ) )  ->  (iEdg `  G )  =  (/) )

Proof of Theorem structiedg0val
StepHypRef Expression
1 structvtxvallem.g . . . . 5  |-  G  =  { <. ( Base `  ndx ) ,  V >. , 
<. S ,  E >. }
2 basendxnn 13103 . . . . . . 7  |-  ( Base `  ndx )  e.  NN
3 simpl 109 . . . . . . 7  |-  ( ( V  e.  X  /\  E  e.  Y )  ->  V  e.  X )
4 opexg 4314 . . . . . . 7  |-  ( ( ( Base `  ndx )  e.  NN  /\  V  e.  X )  ->  <. ( Base `  ndx ) ,  V >.  e.  _V )
52, 3, 4sylancr 414 . . . . . 6  |-  ( ( V  e.  X  /\  E  e.  Y )  -> 
<. ( Base `  ndx ) ,  V >.  e. 
_V )
6 structvtxvallem.s . . . . . . 7  |-  S  e.  NN
7 simpr 110 . . . . . . 7  |-  ( ( V  e.  X  /\  E  e.  Y )  ->  E  e.  Y )
8 opexg 4314 . . . . . . 7  |-  ( ( S  e.  NN  /\  E  e.  Y )  -> 
<. S ,  E >.  e. 
_V )
96, 7, 8sylancr 414 . . . . . 6  |-  ( ( V  e.  X  /\  E  e.  Y )  -> 
<. S ,  E >.  e. 
_V )
10 prexg 4295 . . . . . 6  |-  ( (
<. ( Base `  ndx ) ,  V >.  e. 
_V  /\  <. S ,  E >.  e.  _V )  ->  { <. ( Base `  ndx ) ,  V >. , 
<. S ,  E >. }  e.  _V )
115, 9, 10syl2anc 411 . . . . 5  |-  ( ( V  e.  X  /\  E  e.  Y )  ->  { <. ( Base `  ndx ) ,  V >. , 
<. S ,  E >. }  e.  _V )
121, 11eqeltrid 2316 . . . 4  |-  ( ( V  e.  X  /\  E  e.  Y )  ->  G  e.  _V )
13 structvtxvallem.b . . . . . 6  |-  ( Base `  ndx )  <  S
141, 13, 62strstrndx 13166 . . . . 5  |-  ( ( V  e.  X  /\  E  e.  Y )  ->  G Struct  <. ( Base `  ndx ) ,  S >. )
15 structn0fun 13060 . . . . 5  |-  ( G Struct  <. ( Base `  ndx ) ,  S >.  ->  Fun  ( G  \  { (/)
} ) )
1614, 15syl 14 . . . 4  |-  ( ( V  e.  X  /\  E  e.  Y )  ->  Fun  ( G  \  { (/) } ) )
176, 13, 1struct2slots2dom 15854 . . . 4  |-  ( ( V  e.  X  /\  E  e.  Y )  ->  2o  ~<_  dom  G )
18 funiedgdm2domval 15846 . . . 4  |-  ( ( G  e.  _V  /\  Fun  ( G  \  { (/)
} )  /\  2o  ~<_  dom  G )  ->  (iEdg `  G )  =  (.ef
`  G ) )
1912, 16, 17, 18syl3anc 1271 . . 3  |-  ( ( V  e.  X  /\  E  e.  Y )  ->  (iEdg `  G )  =  (.ef `  G )
)
20193adant3 1041 . 2  |-  ( ( V  e.  X  /\  E  e.  Y  /\  S  =/=  (.ef `  ndx ) )  ->  (iEdg `  G )  =  (.ef
`  G ) )
21 edgfndxid 15825 . . . 4  |-  ( G  e.  _V  ->  (.ef `  G )  =  ( G `  (.ef `  ndx ) ) )
2212, 21syl 14 . . 3  |-  ( ( V  e.  X  /\  E  e.  Y )  ->  (.ef `  G )  =  ( G `  (.ef `  ndx ) ) )
23223adant3 1041 . 2  |-  ( ( V  e.  X  /\  E  e.  Y  /\  S  =/=  (.ef `  ndx ) )  ->  (.ef `  G )  =  ( G `  (.ef `  ndx ) ) )
24 edgfndxnn 15824 . . . 4  |-  (.ef `  ndx )  e.  NN
2524elexi 2812 . . 3  |-  (.ef `  ndx )  e.  _V
26 basendxnedgfndx 15827 . . . . . . . 8  |-  ( Base `  ndx )  =/=  (.ef ` 
ndx )
2726nesymi 2446 . . . . . . 7  |-  -.  (.ef ` 
ndx )  =  (
Base `  ndx )
2827a1i 9 . . . . . 6  |-  ( ( V  e.  X  /\  E  e.  Y  /\  S  =/=  (.ef `  ndx ) )  ->  -.  (.ef `  ndx )  =  ( Base `  ndx ) )
29 neneq 2422 . . . . . . . 8  |-  ( S  =/=  (.ef `  ndx )  ->  -.  S  =  (.ef `  ndx ) )
3029neqcomd 2234 . . . . . . 7  |-  ( S  =/=  (.ef `  ndx )  ->  -.  (.ef `  ndx )  =  S )
31303ad2ant3 1044 . . . . . 6  |-  ( ( V  e.  X  /\  E  e.  Y  /\  S  =/=  (.ef `  ndx ) )  ->  -.  (.ef `  ndx )  =  S )
32 ioran 757 . . . . . 6  |-  ( -.  ( (.ef `  ndx )  =  ( Base ` 
ndx )  \/  (.ef ` 
ndx )  =  S )  <->  ( -.  (.ef ` 
ndx )  =  (
Base `  ndx )  /\  -.  (.ef `  ndx )  =  S ) )
3328, 31, 32sylanbrc 417 . . . . 5  |-  ( ( V  e.  X  /\  E  e.  Y  /\  S  =/=  (.ef `  ndx ) )  ->  -.  ( (.ef `  ndx )  =  ( Base `  ndx )  \/  (.ef `  ndx )  =  S )
)
3425elpr 3687 . . . . 5  |-  ( (.ef
`  ndx )  e.  {
( Base `  ndx ) ,  S }  <->  ( (.ef ` 
ndx )  =  (
Base `  ndx )  \/  (.ef `  ndx )  =  S ) )
3533, 34sylnibr 681 . . . 4  |-  ( ( V  e.  X  /\  E  e.  Y  /\  S  =/=  (.ef `  ndx ) )  ->  -.  (.ef `  ndx )  e. 
{ ( Base `  ndx ) ,  S }
)
361dmeqi 4924 . . . . 5  |-  dom  G  =  dom  { <. ( Base `  ndx ) ,  V >. ,  <. S ,  E >. }
37 dmpropg 5201 . . . . . 6  |-  ( ( V  e.  X  /\  E  e.  Y )  ->  dom  { <. ( Base `  ndx ) ,  V >. ,  <. S ,  E >. }  =  {
( Base `  ndx ) ,  S } )
38373adant3 1041 . . . . 5  |-  ( ( V  e.  X  /\  E  e.  Y  /\  S  =/=  (.ef `  ndx ) )  ->  dom  {
<. ( Base `  ndx ) ,  V >. , 
<. S ,  E >. }  =  { ( Base `  ndx ) ,  S } )
3936, 38eqtrid 2274 . . . 4  |-  ( ( V  e.  X  /\  E  e.  Y  /\  S  =/=  (.ef `  ndx ) )  ->  dom  G  =  { ( Base `  ndx ) ,  S } )
4035, 39neleqtrrd 2328 . . 3  |-  ( ( V  e.  X  /\  E  e.  Y  /\  S  =/=  (.ef `  ndx ) )  ->  -.  (.ef `  ndx )  e. 
dom  G )
41 ndmfvg 5660 . . 3  |-  ( ( (.ef `  ndx )  e. 
_V  /\  -.  (.ef ` 
ndx )  e.  dom  G )  ->  ( G `  (.ef `  ndx ) )  =  (/) )
4225, 40, 41sylancr 414 . 2  |-  ( ( V  e.  X  /\  E  e.  Y  /\  S  =/=  (.ef `  ndx ) )  ->  ( G `  (.ef `  ndx ) )  =  (/) )
4320, 23, 423eqtrd 2266 1  |-  ( ( V  e.  X  /\  E  e.  Y  /\  S  =/=  (.ef `  ndx ) )  ->  (iEdg `  G )  =  (/) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    \/ wo 713    /\ w3a 1002    = wceq 1395    e. wcel 2200    =/= wne 2400   _Vcvv 2799    \ cdif 3194   (/)c0 3491   {csn 3666   {cpr 3667   <.cop 3669   class class class wbr 4083   dom cdm 4719   Fun wfun 5312   ` cfv 5318   2oc2o 6562    ~<_ cdom 6894    < clt 8192   NNcn 9121   Struct cstr 13043   ndxcnx 13044   Basecbs 13047  .efcedgf 15820  iEdgciedg 15829
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8101  ax-resscn 8102  ax-1cn 8103  ax-1re 8104  ax-icn 8105  ax-addcl 8106  ax-addrcl 8107  ax-mulcl 8108  ax-mulrcl 8109  ax-addcom 8110  ax-mulcom 8111  ax-addass 8112  ax-mulass 8113  ax-distr 8114  ax-i2m1 8115  ax-0lt1 8116  ax-1rid 8117  ax-0id 8118  ax-rnegex 8119  ax-precex 8120  ax-cnre 8121  ax-pre-ltirr 8122  ax-pre-ltwlin 8123  ax-pre-lttrn 8124  ax-pre-apti 8125  ax-pre-ltadd 8126  ax-pre-mulgt0 8127
This theorem depends on definitions:  df-bi 117  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-if 3603  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-br 4084  df-opab 4146  df-mpt 4147  df-tr 4183  df-id 4384  df-iord 4457  df-on 4459  df-suc 4462  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-riota 5960  df-ov 6010  df-oprab 6011  df-mpo 6012  df-2nd 6293  df-1o 6568  df-2o 6569  df-en 6896  df-dom 6897  df-pnf 8194  df-mnf 8195  df-xr 8196  df-ltxr 8197  df-le 8198  df-sub 8330  df-neg 8331  df-inn 9122  df-2 9180  df-3 9181  df-4 9182  df-5 9183  df-6 9184  df-7 9185  df-8 9186  df-9 9187  df-n0 9381  df-z 9458  df-dec 9590  df-uz 9734  df-fz 10217  df-struct 13049  df-ndx 13050  df-slot 13051  df-base 13053  df-edgf 15821  df-iedg 15831
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator