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

Theorem structiedg0val 15890
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 13137 . . . . . . 7  |-  ( Base `  ndx )  e.  NN
3 simpl 109 . . . . . . 7  |-  ( ( V  e.  X  /\  E  e.  Y )  ->  V  e.  X )
4 opexg 4320 . . . . . . 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 4320 . . . . . . 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 4301 . . . . . 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 2318 . . . 4  |-  ( ( V  e.  X  /\  E  e.  Y )  ->  G  e.  _V )
13 structvtxvallem.b . . . . . 6  |-  ( Base `  ndx )  <  S
141, 13, 62strstrndx 13200 . . . . 5  |-  ( ( V  e.  X  /\  E  e.  Y )  ->  G Struct  <. ( Base `  ndx ) ,  S >. )
15 structn0fun 13094 . . . . 5  |-  ( G Struct  <. ( Base `  ndx ) ,  S >.  ->  Fun  ( G  \  { (/)
} ) )
1614, 15syl 14 . . . 4  |-  ( ( V  e.  X  /\  E  e.  Y )  ->  Fun  ( G  \  { (/) } ) )
176, 13, 1struct2slots2dom 15888 . . . 4  |-  ( ( V  e.  X  /\  E  e.  Y )  ->  2o  ~<_  dom  G )
18 funiedgdm2domval 15880 . . . 4  |-  ( ( G  e.  _V  /\  Fun  ( G  \  { (/)
} )  /\  2o  ~<_  dom  G )  ->  (iEdg `  G )  =  (.ef
`  G ) )
1912, 16, 17, 18syl3anc 1273 . . 3  |-  ( ( V  e.  X  /\  E  e.  Y )  ->  (iEdg `  G )  =  (.ef `  G )
)
20193adant3 1043 . 2  |-  ( ( V  e.  X  /\  E  e.  Y  /\  S  =/=  (.ef `  ndx ) )  ->  (iEdg `  G )  =  (.ef
`  G ) )
21 edgfndxid 15859 . . . 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 1043 . 2  |-  ( ( V  e.  X  /\  E  e.  Y  /\  S  =/=  (.ef `  ndx ) )  ->  (.ef `  G )  =  ( G `  (.ef `  ndx ) ) )
24 edgfndxnn 15858 . . . 4  |-  (.ef `  ndx )  e.  NN
2524elexi 2815 . . 3  |-  (.ef `  ndx )  e.  _V
26 basendxnedgfndx 15861 . . . . . . . 8  |-  ( Base `  ndx )  =/=  (.ef ` 
ndx )
2726nesymi 2448 . . . . . . 7  |-  -.  (.ef ` 
ndx )  =  (
Base `  ndx )
2827a1i 9 . . . . . 6  |-  ( ( V  e.  X  /\  E  e.  Y  /\  S  =/=  (.ef `  ndx ) )  ->  -.  (.ef `  ndx )  =  ( Base `  ndx ) )
29 neneq 2424 . . . . . . . 8  |-  ( S  =/=  (.ef `  ndx )  ->  -.  S  =  (.ef `  ndx ) )
3029neqcomd 2236 . . . . . . 7  |-  ( S  =/=  (.ef `  ndx )  ->  -.  (.ef `  ndx )  =  S )
31303ad2ant3 1046 . . . . . 6  |-  ( ( V  e.  X  /\  E  e.  Y  /\  S  =/=  (.ef `  ndx ) )  ->  -.  (.ef `  ndx )  =  S )
32 ioran 759 . . . . . 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 3690 . . . . 5  |-  ( (.ef
`  ndx )  e.  {
( Base `  ndx ) ,  S }  <->  ( (.ef ` 
ndx )  =  (
Base `  ndx )  \/  (.ef `  ndx )  =  S ) )
3533, 34sylnibr 683 . . . 4  |-  ( ( V  e.  X  /\  E  e.  Y  /\  S  =/=  (.ef `  ndx ) )  ->  -.  (.ef `  ndx )  e. 
{ ( Base `  ndx ) ,  S }
)
361dmeqi 4932 . . . . 5  |-  dom  G  =  dom  { <. ( Base `  ndx ) ,  V >. ,  <. S ,  E >. }
37 dmpropg 5209 . . . . . 6  |-  ( ( V  e.  X  /\  E  e.  Y )  ->  dom  { <. ( Base `  ndx ) ,  V >. ,  <. S ,  E >. }  =  {
( Base `  ndx ) ,  S } )
38373adant3 1043 . . . . 5  |-  ( ( V  e.  X  /\  E  e.  Y  /\  S  =/=  (.ef `  ndx ) )  ->  dom  {
<. ( Base `  ndx ) ,  V >. , 
<. S ,  E >. }  =  { ( Base `  ndx ) ,  S } )
3936, 38eqtrid 2276 . . . 4  |-  ( ( V  e.  X  /\  E  e.  Y  /\  S  =/=  (.ef `  ndx ) )  ->  dom  G  =  { ( Base `  ndx ) ,  S } )
4035, 39neleqtrrd 2330 . . 3  |-  ( ( V  e.  X  /\  E  e.  Y  /\  S  =/=  (.ef `  ndx ) )  ->  -.  (.ef `  ndx )  e. 
dom  G )
41 ndmfvg 5670 . . 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 2268 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 715    /\ w3a 1004    = wceq 1397    e. wcel 2202    =/= wne 2402   _Vcvv 2802    \ cdif 3197   (/)c0 3494   {csn 3669   {cpr 3670   <.cop 3672   class class class wbr 4088   dom cdm 4725   Fun wfun 5320   ` cfv 5326   2oc2o 6575    ~<_ cdom 6907    < clt 8213   NNcn 9142   Struct cstr 13077   ndxcnx 13078   Basecbs 13081  .efcedgf 15854  iEdgciedg 15863
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-mulrcl 8130  ax-addcom 8131  ax-mulcom 8132  ax-addass 8133  ax-mulass 8134  ax-distr 8135  ax-i2m1 8136  ax-0lt1 8137  ax-1rid 8138  ax-0id 8139  ax-rnegex 8140  ax-precex 8141  ax-cnre 8142  ax-pre-ltirr 8143  ax-pre-ltwlin 8144  ax-pre-lttrn 8145  ax-pre-apti 8146  ax-pre-ltadd 8147  ax-pre-mulgt0 8148
This theorem depends on definitions:  df-bi 117  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-if 3606  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-iord 4463  df-on 4465  df-suc 4468  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-2nd 6303  df-1o 6581  df-2o 6582  df-en 6909  df-dom 6910  df-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219  df-sub 8351  df-neg 8352  df-inn 9143  df-2 9201  df-3 9202  df-4 9203  df-5 9204  df-6 9205  df-7 9206  df-8 9207  df-9 9208  df-n0 9402  df-z 9479  df-dec 9611  df-uz 9755  df-fz 10243  df-struct 13083  df-ndx 13084  df-slot 13085  df-base 13087  df-edgf 15855  df-iedg 15865
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator