Theorem subgrprop3 16503

Description: The properties of a subgraph: If S is a subgraph of G, its vertices are also vertices of G, and its edges are also edges of G. (Contributed by AV, 19-Nov-2020.)

Hypotheses

Ref	Expression
subgrprop3.v	|- V = (Vtx ` S )
subgrprop3.a	|- A = (Vtx ` G )
subgrprop3.e	|- E = (Edg ` S )
subgrprop3.b	|- B = (Edg ` G )

Assertion

Ref	Expression
subgrprop3	|- ( S SubGraph G -> ( V C_ A /\ E C_ B ) )

Proof of Theorem subgrprop3

Step	Hyp	Ref	Expression
1		subgrprop3.v	. . . 4 |- V = (Vtx ` S )
2		subgrprop3.a	. . . 4 |- A = (Vtx ` G )
3		eqid 2238	. . . 4 |- (iEdg ` S ) = (iEdg ` S )
4		eqid 2238	. . . 4 |- (iEdg ` G ) = (iEdg ` G )
5		subgrprop3.e	. . . 4 |- E = (Edg ` S )
6	1, 2, 3, 4, 5	subgrprop2 16501	. . 3 |- ( S SubGraph G -> ( V C_ A /\ (iEdg ` S ) C_ (iEdg ` G ) /\ E C_ ~P V ) )
7		3simpa 1025	. . 3 |- ( ( V C_ A /\ (iEdg ` S ) C_ (iEdg ` G ) /\ E C_ ~P V ) -> ( V C_ A /\ (iEdg ` S ) C_ (iEdg ` G ) ) )
8	6, 7	syl 14	. 2 |- ( S SubGraph G -> ( V C_ A /\ (iEdg ` S ) C_ (iEdg ` G ) ) )
9		simprl 535	. . 3 |- ( ( S SubGraph G /\ ( V C_ A /\ (iEdg ` S ) C_ (iEdg ` G ) ) ) -> V C_ A )
10		rnss 5012	. . . . 5 |- ( (iEdg ` S ) C_ (iEdg ` G ) -> ran (iEdg ` S ) C_ ran (iEdg ` G ) )
11	10	ad2antll 495	. . . 4 |- ( ( S SubGraph G /\ ( V C_ A /\ (iEdg ` S ) C_ (iEdg ` G ) ) ) -> ran (iEdg ` S ) C_ ran (iEdg ` G ) )
12		subgrv 16497	. . . . . 6 |- ( S SubGraph G -> ( S e. _V /\ G e. _V ) )
13		edgval 16301	. . . . . . . . 9 |- (Edg ` S ) = ran (iEdg ` S )
14	13	a1i 9	. . . . . . . 8 |- ( ( S e. _V /\ G e. _V ) -> (Edg ` S ) = ran (iEdg ` S ) )
15	5, 14	eqtrid 2283	. . . . . . 7 |- ( ( S e. _V /\ G e. _V ) -> E = ran (iEdg ` S ) )
16		subgrprop3.b	. . . . . . . 8 |- B = (Edg ` G )
17		edgval 16301	. . . . . . . . 9 |- (Edg ` G ) = ran (iEdg ` G )
18	17	a1i 9	. . . . . . . 8 |- ( ( S e. _V /\ G e. _V ) -> (Edg ` G ) = ran (iEdg ` G ) )
19	16, 18	eqtrid 2283	. . . . . . 7 |- ( ( S e. _V /\ G e. _V ) -> B = ran (iEdg ` G ) )
20	15, 19	sseq12d 3279	. . . . . 6 |- ( ( S e. _V /\ G e. _V ) -> ( E C_ B <-> ran (iEdg ` S ) C_ ran (iEdg ` G ) ) )
21	12, 20	syl 14	. . . . 5 |- ( S SubGraph G -> ( E C_ B <-> ran (iEdg ` S ) C_ ran (iEdg ` G ) ) )
22	21	adantr 276	. . . 4 |- ( ( S SubGraph G /\ ( V C_ A /\ (iEdg ` S ) C_ (iEdg ` G ) ) ) -> ( E C_ B <-> ran (iEdg ` S ) C_ ran (iEdg ` G ) ) )
23	11, 22	mpbird 167	. . 3 |- ( ( S SubGraph G /\ ( V C_ A /\ (iEdg ` S ) C_ (iEdg ` G ) ) ) -> E C_ B )
24	9, 23	jca 306	. 2 |- ( ( S SubGraph G /\ ( V C_ A /\ (iEdg ` S ) C_ (iEdg ` G ) ) ) -> ( V C_ A /\ E C_ B ) )
25	8, 24	mpdan 425	1 |- ( S SubGraph G -> ( V C_ A /\ E C_ B ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1009   = wceq 1402   e. wcel 2209   _Vcvv 2821   C_ wss 3220   ~Pcpw 3688   class class class wbr 4130   ran crn 4775   ` cfv 5377  Vtxcvtx 16253  iEdgciedg 16254  Edgcedg 16298   SubGraph csubgr 16494

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fo 5383  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-2nd 6375  df-sub 8499  df-inn 9305  df-2 9363  df-3 9364  df-4 9365  df-5 9366  df-6 9367  df-7 9368  df-8 9369  df-9 9370  df-n0 9564  df-dec 9778  df-ndx 13355  df-slot 13356  df-edgf 16246  df-iedg 16256  df-edg 16299  df-subgr 16495

This theorem is used by: (None)