Theorem grstructeld2dom 16171

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

Step	Hyp	Ref	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 )
9	1, 2, 3, 4, 5, 6, 7, 8	grstructd2dom 16169	. 2 |- ( ph -> [. S / g ]. g e. C )
10		sbcel1v 3108	. 2 |- ( [. S / g ]. g e. C <-> S e. C )
11	9, 10	sylib 122	1 |- ( ph -> S e. C )

Syntax hints:   -> wi 4   /\ wa 104   A.wal 1396   = wceq 1398   e. wcel 2205   [.wsbc 3045   \ cdif 3211   (/)c0 3512   {csn 3694   class class class wbr 4114   dom cdm 4754   Fun wfun 5351   ` cfv 5357   2oc2o 6654   ~<_ cdom 6987   Basecbs 13296  .efcedgf 16125  Vtxcvtx 16133  iEdgciedg 16134

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-mulcom 8244  ax-addass 8245  ax-mulass 8246  ax-distr 8247  ax-i2m1 8248  ax-1rid 8250  ax-0id 8251  ax-rnegex 8252  ax-cnre 8254

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-if 3625  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-suc 4497  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-1o 6660  df-2o 6661  df-dom 6990  df-sub 8462  df-inn 9255  df-2 9313  df-3 9314  df-4 9315  df-5 9316  df-6 9317  df-7 9318  df-8 9319  df-9 9320  df-n0 9514  df-dec 9728  df-ndx 13299  df-slot 13300  df-base 13302  df-edgf 16126  df-vtx 16135  df-iedg 16136

This theorem is referenced by: (None)