Theorem gropd 15897

Description: If any representation of a graph with vertices V and edges E has a certain property ps, then the ordered pair <. V , E >. of the set of vertices and the set of edges (which is such a representation of a graph with vertices V and edges E) has this property. (Contributed by AV, 11-Oct-2020.)

Hypotheses

Ref	Expression
gropd.g	|- ( ph -> A. g ( ( (Vtx ` g ) = V /\ (iEdg ` g ) = E ) -> ps ) )
gropd.v	|- ( ph -> V e. U )
gropd.e	|- ( ph -> E e. W )

Assertion

Ref	Expression
gropd	|- ( ph -> [. <. V , E >. / g ]. ps )

Distinct variable groups:   g, E   g, V   ph, g

Allowed substitution hints:   ps( g)   U( g)   W( g)

Proof of Theorem gropd

Step	Hyp	Ref	Expression
1		gropd.v	. . 3 |- ( ph -> V e. U )
2		gropd.e	. . 3 |- ( ph -> E e. W )
3		opexg 4320	. . 3 |- ( ( V e. U /\ E e. W ) -> <. V , E >. e. _V )
4	1, 2, 3	syl2anc 411	. 2 |- ( ph -> <. V , E >. e. _V )
5		gropd.g	. 2 |- ( ph -> A. g ( ( (Vtx ` g ) = V /\ (iEdg ` g ) = E ) -> ps ) )
6		opvtxfv 15872	. . . 4 |- ( ( V e. U /\ E e. W ) -> (Vtx ` <. V , E >. ) = V )
7		opiedgfv 15875	. . . 4 |- ( ( V e. U /\ E e. W ) -> (iEdg ` <. V , E >. ) = E )
8	6, 7	jca 306	. . 3 |- ( ( V e. U /\ E e. W ) -> ( (Vtx ` <. V , E >. ) = V /\ (iEdg ` <. V , E >. ) = E ) )
9	1, 2, 8	syl2anc 411	. 2 |- ( ph -> ( (Vtx ` <. V , E >. ) = V /\ (iEdg ` <. V , E >. ) = E ) )
10		nfcv 2374	. . 3 |- F/_ g <. V , E >.
11		nfv 1576	. . . 4 |- F/ g ( (Vtx ` <. V , E >. ) = V /\ (iEdg ` <. V , E >. ) = E )
12		nfsbc1v 3050	. . . 4 |- F/ g [. <. V , E >. / g ]. ps
13	11, 12	nfim 1620	. . 3 |- F/ g ( ( (Vtx ` <. V , E >. ) = V /\ (iEdg ` <. V , E >. ) = E ) -> [. <. V , E >. / g ]. ps )
14		fveqeq2 5648	. . . . 5 |- ( g = <. V , E >. -> ( (Vtx ` g ) = V <-> (Vtx ` <. V , E >. ) = V ) )
15		fveqeq2 5648	. . . . 5 |- ( g = <. V , E >. -> ( (iEdg ` g ) = E <-> (iEdg ` <. V , E >. ) = E ) )
16	14, 15	anbi12d 473	. . . 4 |- ( g = <. V , E >. -> ( ( (Vtx ` g ) = V /\ (iEdg ` g ) = E ) <-> ( (Vtx ` <. V , E >. ) = V /\ (iEdg ` <. V , E >. ) = E ) ) )
17		sbceq1a 3041	. . . 4 |- ( g = <. V , E >. -> ( ps <-> [. <. V , E >. / g ]. ps ) )
18	16, 17	imbi12d 234	. . 3 |- ( g = <. V , E >. -> ( ( ( (Vtx ` g ) = V /\ (iEdg ` g ) = E ) -> ps ) <-> ( ( (Vtx ` <. V , E >. ) = V /\ (iEdg ` <. V , E >. ) = E ) -> [. <. V , E >. / g ]. ps ) ) )
19	10, 13, 18	spcgf 2888	. 2 |- ( <. V , E >. e. _V -> ( A. g ( ( (Vtx ` g ) = V /\ (iEdg ` g ) = E ) -> ps ) -> ( ( (Vtx ` <. V , E >. ) = V /\ (iEdg ` <. V , E >. ) = E ) -> [. <. V , E >. / g ]. ps ) ) )
20	4, 5, 9, 19	syl3c 63	1 |- ( ph -> [. <. V , E >. / g ]. ps )

Syntax hints:   -> wi 4   /\ wa 104   A.wal 1395   = wceq 1397   e. wcel 2202   _Vcvv 2802   [.wsbc 3031   <.cop 3672   ` cfv 5326  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-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-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-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-fo 5332  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  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:  gropeld  15899