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

Theorem grstructeld2dom 15900
Description: If any representation of a graph with vertices  V and edges  E is an element of an arbitrary class  C, then any structure with base set  V and value  E in the slot for edge functions (which is such a representation of a graph with vertices  V and edges  E) is an element of this class  C. (Contributed by AV, 12-Oct-2020.) (Revised by AV, 9-Jun-2021.)
Hypotheses
Ref Expression
gropeld.g  |-  ( ph  ->  A. g ( ( (Vtx `  g )  =  V  /\  (iEdg `  g )  =  E )  ->  g  e.  C ) )
gropeld.v  |-  ( ph  ->  V  e.  U )
gropeld.e  |-  ( ph  ->  E  e.  W )
grstructeld.s  |-  ( ph  ->  S  e.  X )
grstructeld.f  |-  ( ph  ->  Fun  ( S  \  { (/) } ) )
grstructeld2dom.d  |-  ( ph  ->  2o  ~<_  dom  S )
grstructeld.b  |-  ( ph  ->  ( Base `  S
)  =  V )
grstructeld.e  |-  ( ph  ->  (.ef `  S )  =  E )
Assertion
Ref Expression
grstructeld2dom  |-  ( ph  ->  S  e.  C )
Distinct variable groups:    C, g    g, E    g, V    ph, g    S, g
Allowed substitution hints:    U( g)    W( g)    X( g)

Proof of Theorem grstructeld2dom
StepHypRef Expression
1 gropeld.g . . 3  |-  ( ph  ->  A. g ( ( (Vtx `  g )  =  V  /\  (iEdg `  g )  =  E )  ->  g  e.  C ) )
2 gropeld.v . . 3  |-  ( ph  ->  V  e.  U )
3 gropeld.e . . 3  |-  ( ph  ->  E  e.  W )
4 grstructeld.s . . 3  |-  ( ph  ->  S  e.  X )
5 grstructeld.f . . 3  |-  ( ph  ->  Fun  ( S  \  { (/) } ) )
6 grstructeld2dom.d . . 3  |-  ( ph  ->  2o  ~<_  dom  S )
7 grstructeld.b . . 3  |-  ( ph  ->  ( Base `  S
)  =  V )
8 grstructeld.e . . 3  |-  ( ph  ->  (.ef `  S )  =  E )
91, 2, 3, 4, 5, 6, 7, 8grstructd2dom 15898 . 2  |-  ( ph  ->  [. S  /  g ]. g  e.  C
)
10 sbcel1v 3094 . 2  |-  ( [. S  /  g ]. g  e.  C  <->  S  e.  C
)
119, 10sylib 122 1  |-  ( ph  ->  S  e.  C )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104   A.wal 1395    = wceq 1397    e. wcel 2202   [.wsbc 3031    \ cdif 3197   (/)c0 3494   {csn 3669   class class class wbr 4088   dom cdm 4725   Fun wfun 5320   ` cfv 5326   2oc2o 6575    ~<_ cdom 6907   Basecbs 13081  .efcedgf 15854  Vtxcvtx 15862  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-addcom 8131  ax-mulcom 8132  ax-addass 8133  ax-mulass 8134  ax-distr 8135  ax-i2m1 8136  ax-1rid 8138  ax-0id 8139  ax-rnegex 8140  ax-cnre 8142
This theorem depends on definitions:  df-bi 117  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-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-id 4390  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-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-1o 6581  df-2o 6582  df-dom 6910  df-sub 8351  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-dec 9611  df-ndx 13084  df-slot 13085  df-base 13087  df-edgf 15855  df-vtx 15864  df-iedg 15865
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator