Theorem upgrspanop 16207

Description: A spanning subgraph of a pseudograph represented by an ordered pair is a pseudograph. (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by AV, 13-Oct-2020.)

Hypotheses

Ref	Expression
uhgrspanop.v	|- V = (Vtx ` G )
uhgrspanop.e	|- E = (iEdg ` G )

Assertion

Ref	Expression
upgrspanop	|- ( G e. UPGraph -> <. V , ( E |` A ) >. e. UPGraph )

Proof of Theorem upgrspanop

Dummy variable g is distinct from all other variables.

Step	Hyp	Ref	Expression
1		uhgrspanop.v	. . . . 5 |- V = (Vtx ` G )
2		uhgrspanop.e	. . . . 5 |- E = (iEdg ` G )
3		vex 2806	. . . . . 6 |- g e. _V
4	3	a1i 9	. . . . 5 |- ( ( G e. UPGraph /\ ( (Vtx ` g ) = V /\ (iEdg ` g ) = ( E |` A ) ) ) -> g e. _V )
5		simprl 531	. . . . 5 |- ( ( G e. UPGraph /\ ( (Vtx ` g ) = V /\ (iEdg ` g ) = ( E |` A ) ) ) -> (Vtx ` g ) = V )
6		simprr 533	. . . . 5 |- ( ( G e. UPGraph /\ ( (Vtx ` g ) = V /\ (iEdg ` g ) = ( E |` A ) ) ) -> (iEdg ` g ) = ( E |` A ) )
7		simpl 109	. . . . 5 |- ( ( G e. UPGraph /\ ( (Vtx ` g ) = V /\ (iEdg ` g ) = ( E |` A ) ) ) -> G e. UPGraph )
8	1, 2, 4, 5, 6, 7	upgrspan 16203	. . . 4 |- ( ( G e. UPGraph /\ ( (Vtx ` g ) = V /\ (iEdg ` g ) = ( E |` A ) ) ) -> g e. UPGraph )
9	8	ex 115	. . 3 |- ( G e. UPGraph -> ( ( (Vtx ` g ) = V /\ (iEdg ` g ) = ( E |` A ) ) -> g e. UPGraph ) )
10	9	alrimiv 1922	. 2 |- ( G e. UPGraph -> A. g ( ( (Vtx ` g ) = V /\ (iEdg ` g ) = ( E |` A ) ) -> g e. UPGraph ) )
11		vtxex 15942	. . 3 |- ( G e. UPGraph -> (Vtx ` G ) e. _V )
12	1, 11	eqeltrid 2318	. 2 |- ( G e. UPGraph -> V e. _V )
13		iedgex 15943	. . . 4 |- ( G e. UPGraph -> (iEdg ` G ) e. _V )
14	2, 13	eqeltrid 2318	. . 3 |- ( G e. UPGraph -> E e. _V )
15		resexg 5059	. . 3 |- ( E e. _V -> ( E |` A ) e. _V )
16	14, 15	syl 14	. 2 |- ( G e. UPGraph -> ( E |` A ) e. _V )
17	10, 12, 16	gropeld 15973	1 |- ( G e. UPGraph -> <. V , ( E |` A ) >. e. UPGraph )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1398   e. wcel 2202   _Vcvv 2803   <.cop 3676   |` cres 4733   ` cfv 5333  Vtxcvtx 15936  iEdgciedg 15937  UPGraphcupgr 16015

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 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8166  ax-resscn 8167  ax-1cn 8168  ax-1re 8169  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-addcom 8175  ax-mulcom 8176  ax-addass 8177  ax-mulass 8178  ax-distr 8179  ax-i2m1 8180  ax-1rid 8182  ax-0id 8183  ax-rnegex 8184  ax-cnre 8186

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-if 3608  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-iord 4469  df-on 4471  df-suc 4474  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-1o 6625  df-2o 6626  df-en 6953  df-sub 8394  df-inn 9186  df-2 9244  df-3 9245  df-4 9246  df-5 9247  df-6 9248  df-7 9249  df-8 9250  df-9 9251  df-n0 9445  df-dec 9656  df-ndx 13148  df-slot 13149  df-base 13151  df-edgf 15929  df-vtx 15938  df-iedg 15939  df-edg 15982  df-uhgrm 15993  df-upgren 16017  df-subgr 16178

This theorem is referenced by: (None)