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

Theorem structiedg0val 16195
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 13386 . . . . . . 7  |-  ( Base `  ndx )  e.  NN
3 simpl 109 . . . . . . 7  |-  ( ( V  e.  X  /\  E  e.  Y )  ->  V  e.  X )
4 opexg 4363 . . . . . . 7  |-  ( ( ( Base `  ndx )  e.  NN  /\  V  e.  X )  ->  <. ( Base `  ndx ) ,  V >.  e.  _V )
52, 3, 4sylancr 418 . . . . . 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 4363 . . . . . . 7  |-  ( ( S  e.  NN  /\  E  e.  Y )  -> 
<. S ,  E >.  e. 
_V )
96, 7, 8sylancr 418 . . . . . 6  |-  ( ( V  e.  X  /\  E  e.  Y )  -> 
<. S ,  E >.  e. 
_V )
10 prexg 4344 . . . . . 6  |-  ( (
<. ( Base `  ndx ) ,  V >.  e. 
_V  /\  <. S ,  E >.  e.  _V )  ->  { <. ( Base `  ndx ) ,  V >. , 
<. S ,  E >. }  e.  _V )
115, 9, 10syl2anc 415 . . . . 5  |-  ( ( V  e.  X  /\  E  e.  Y )  ->  { <. ( Base `  ndx ) ,  V >. , 
<. S ,  E >. }  e.  _V )
121, 11eqeltrid 2325 . . . 4  |-  ( ( V  e.  X  /\  E  e.  Y )  ->  G  e.  _V )
13 structvtxvallem.b . . . . . 6  |-  ( Base `  ndx )  <  S
141, 13, 62strstrndx 13449 . . . . 5  |-  ( ( V  e.  X  /\  E  e.  Y )  ->  G Struct  <. ( Base `  ndx ) ,  S >. )
15 structn0fun 13343 . . . . 5  |-  ( G Struct  <. ( Base `  ndx ) ,  S >.  ->  Fun  ( G  \  { (/)
} ) )
1614, 15syl 14 . . . 4  |-  ( ( V  e.  X  /\  E  e.  Y )  ->  Fun  ( G  \  { (/) } ) )
176, 13, 1struct2slots2dom 16193 . . . 4  |-  ( ( V  e.  X  /\  E  e.  Y )  ->  2o  ~<_  dom  G )
18 funiedgdm2domval 16185 . . . 4  |-  ( ( G  e.  _V  /\  Fun  ( G  \  { (/)
} )  /\  2o  ~<_  dom  G )  ->  (iEdg `  G )  =  (.ef
`  G ) )
1912, 16, 17, 18syl3anc 1278 . . 3  |-  ( ( V  e.  X  /\  E  e.  Y )  ->  (iEdg `  G )  =  (.ef `  G )
)
20193adant3 1048 . 2  |-  ( ( V  e.  X  /\  E  e.  Y  /\  S  =/=  (.ef `  ndx ) )  ->  (iEdg `  G )  =  (.ef
`  G ) )
21 edgfndxid 16164 . . . 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 1048 . 2  |-  ( ( V  e.  X  /\  E  e.  Y  /\  S  =/=  (.ef `  ndx ) )  ->  (.ef `  G )  =  ( G `  (.ef `  ndx ) ) )
24 edgfndxnn 16163 . . . 4  |-  (.ef `  ndx )  e.  NN
2524elexi 2834 . . 3  |-  (.ef `  ndx )  e.  _V
26 basendxnedgfndx 16166 . . . . . . . 8  |-  ( Base `  ndx )  =/=  (.ef ` 
ndx )
2726nesymi 2466 . . . . . . 7  |-  -.  (.ef ` 
ndx )  =  (
Base `  ndx )
2827a1i 9 . . . . . 6  |-  ( ( V  e.  X  /\  E  e.  Y  /\  S  =/=  (.ef `  ndx ) )  ->  -.  (.ef `  ndx )  =  ( Base `  ndx ) )
29 neneq 2442 . . . . . . . 8  |-  ( S  =/=  (.ef `  ndx )  ->  -.  S  =  (.ef `  ndx ) )
3029neqcomd 2243 . . . . . . 7  |-  ( S  =/=  (.ef `  ndx )  ->  -.  (.ef `  ndx )  =  S )
31303ad2ant3 1051 . . . . . 6  |-  ( ( V  e.  X  /\  E  e.  Y  /\  S  =/=  (.ef `  ndx ) )  ->  -.  (.ef `  ndx )  =  S )
32 ioran 764 . . . . . 6  |-  ( -.  ( (.ef `  ndx )  =  ( Base ` 
ndx )  \/  (.ef ` 
ndx )  =  S )  <->  ( -.  (.ef ` 
ndx )  =  (
Base `  ndx )  /\  -.  (.ef `  ndx )  =  S ) )
3328, 31, 32sylanbrc 421 . . . . 5  |-  ( ( V  e.  X  /\  E  e.  Y  /\  S  =/=  (.ef `  ndx ) )  ->  -.  ( (.ef `  ndx )  =  ( Base `  ndx )  \/  (.ef `  ndx )  =  S )
)
3425elpr 3726 . . . . 5  |-  ( (.ef
`  ndx )  e.  {
( Base `  ndx ) ,  S }  <->  ( (.ef ` 
ndx )  =  (
Base `  ndx )  \/  (.ef `  ndx )  =  S ) )
3533, 34sylnibr 688 . . . 4  |-  ( ( V  e.  X  /\  E  e.  Y  /\  S  =/=  (.ef `  ndx ) )  ->  -.  (.ef `  ndx )  e. 
{ ( Base `  ndx ) ,  S }
)
361dmeqi 4977 . . . . 5  |-  dom  G  =  dom  { <. ( Base `  ndx ) ,  V >. ,  <. S ,  E >. }
37 dmpropg 5255 . . . . . 6  |-  ( ( V  e.  X  /\  E  e.  Y )  ->  dom  { <. ( Base `  ndx ) ,  V >. ,  <. S ,  E >. }  =  {
( Base `  ndx ) ,  S } )
38373adant3 1048 . . . . 5  |-  ( ( V  e.  X  /\  E  e.  Y  /\  S  =/=  (.ef `  ndx ) )  ->  dom  {
<. ( Base `  ndx ) ,  V >. , 
<. S ,  E >. }  =  { ( Base `  ndx ) ,  S } )
3936, 38eqtrid 2283 . . . 4  |-  ( ( V  e.  X  /\  E  e.  Y  /\  S  =/=  (.ef `  ndx ) )  ->  dom  G  =  { ( Base `  ndx ) ,  S } )
4035, 39neleqtrrd 2337 . . 3  |-  ( ( V  e.  X  /\  E  e.  Y  /\  S  =/=  (.ef `  ndx ) )  ->  -.  (.ef `  ndx )  e. 
dom  G )
41 ndmfvg 5721 . . 3  |-  ( ( (.ef `  ndx )  e. 
_V  /\  -.  (.ef ` 
ndx )  e.  dom  G )  ->  ( G `  (.ef `  ndx ) )  =  (/) )
4225, 40, 41sylancr 418 . 2  |-  ( ( V  e.  X  /\  E  e.  Y  /\  S  =/=  (.ef `  ndx ) )  ->  ( G `  (.ef `  ndx ) )  =  (/) )
4320, 23, 423eqtrd 2275 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 720    /\ w3a 1009    = wceq 1402    e. wcel 2209    =/= wne 2420   _Vcvv 2821    \ cdif 3217   (/)c0 3520   {csn 3705   {cpr 3706   <.cop 3708   class class class wbr 4125   dom cdm 4769   Fun wfun 5366   ` cfv 5372   2oc2o 6671    ~<_ cdom 7011    < clt 8350   NNcn 9283   Struct cstr 13326   ndxcnx 13327   Basecbs 13330  .efcedgf 16159  iEdgciedg 16168
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-mulrcl 8268  ax-addcom 8269  ax-mulcom 8270  ax-addass 8271  ax-mulass 8272  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-1rid 8276  ax-0id 8277  ax-rnegex 8278  ax-precex 8279  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283  ax-pre-apti 8284  ax-pre-ltadd 8285  ax-pre-mulgt0 8286
This theorem depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3636  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-iord 4506  df-on 4508  df-suc 4511  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-2nd 6365  df-1o 6677  df-2o 6678  df-en 7013  df-dom 7014  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-sub 8489  df-neg 8490  df-inn 9284  df-2 9342  df-3 9343  df-4 9344  df-5 9345  df-6 9346  df-7 9347  df-8 9348  df-9 9349  df-n0 9543  df-z 9624  df-dec 9757  df-uz 9901  df-fz 10391  df-struct 13332  df-ndx 13333  df-slot 13334  df-base 13336  df-edgf 16160  df-iedg 16170
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator