MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  subgrprop2 Structured version   Visualization version   GIF version

Theorem subgrprop2 29254
Description: The properties of a subgraph: If 𝑆 is a subgraph of 𝐺, its vertices are also vertices of 𝐺, and its edges are also edges of 𝐺, connecting vertices of the subgraph only. (Contributed by AV, 19-Nov-2020.)
Hypotheses
Ref Expression
issubgr.v 𝑉 = (Vtx‘𝑆)
issubgr.a 𝐴 = (Vtx‘𝐺)
issubgr.i 𝐼 = (iEdg‘𝑆)
issubgr.b 𝐵 = (iEdg‘𝐺)
issubgr.e 𝐸 = (Edg‘𝑆)
Assertion
Ref Expression
subgrprop2 (𝑆 SubGraph 𝐺 → (𝑉𝐴𝐼𝐵𝐸 ⊆ 𝒫 𝑉))

Proof of Theorem subgrprop2
StepHypRef Expression
1 issubgr.v . . 3 𝑉 = (Vtx‘𝑆)
2 issubgr.a . . 3 𝐴 = (Vtx‘𝐺)
3 issubgr.i . . 3 𝐼 = (iEdg‘𝑆)
4 issubgr.b . . 3 𝐵 = (iEdg‘𝐺)
5 issubgr.e . . 3 𝐸 = (Edg‘𝑆)
61, 2, 3, 4, 5subgrprop 29253 . 2 (𝑆 SubGraph 𝐺 → (𝑉𝐴𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉))
7 resss 5954 . . . 4 (𝐵 ↾ dom 𝐼) ⊆ 𝐵
8 sseq1 3956 . . . 4 (𝐼 = (𝐵 ↾ dom 𝐼) → (𝐼𝐵 ↔ (𝐵 ↾ dom 𝐼) ⊆ 𝐵))
97, 8mpbiri 258 . . 3 (𝐼 = (𝐵 ↾ dom 𝐼) → 𝐼𝐵)
1093anim2i 1153 . 2 ((𝑉𝐴𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉) → (𝑉𝐴𝐼𝐵𝐸 ⊆ 𝒫 𝑉))
116, 10syl 17 1 (𝑆 SubGraph 𝐺 → (𝑉𝐴𝐼𝐵𝐸 ⊆ 𝒫 𝑉))
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1086   = wceq 1541  wss 3898  𝒫 cpw 4549   class class class wbr 5093  dom cdm 5619  cres 5621  cfv 6486  Vtxcvtx 28976  iEdgciedg 28977  Edgcedg 29027   SubGraph csubgr 29247
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2705  ax-sep 5236  ax-nul 5246  ax-pr 5372
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2712  df-cleq 2725  df-clel 2808  df-ral 3049  df-rex 3058  df-rab 3397  df-v 3439  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4283  df-if 4475  df-pw 4551  df-sn 4576  df-pr 4578  df-op 4582  df-uni 4859  df-br 5094  df-opab 5156  df-xp 5625  df-rel 5626  df-dm 5629  df-res 5631  df-iota 6442  df-fv 6494  df-subgr 29248
This theorem is referenced by:  uhgrissubgr  29255  subgrprop3  29256  subgrfun  29261  subgreldmiedg  29263  subgruhgredgd  29264  subumgredg2  29265  subuhgr  29266  subupgr  29267  subumgr  29268  subusgr  29269  subgrwlk  35197
  Copyright terms: Public domain W3C validator