Theorem subgrprop 29356

Description: The properties of a subgraph. (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
subgrprop	⊢ (𝑆 SubGraph 𝐺 → (𝑉 ⊆ 𝐴 ∧ 𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉))

Proof of Theorem subgrprop

Step	Hyp	Ref	Expression
1		subgrv 29353	. 2 ⊢ (𝑆 SubGraph 𝐺 → (𝑆 ∈ V ∧ 𝐺 ∈ V))
2		issubgr.v	. . . . 5 ⊢ 𝑉 = (Vtx‘𝑆)
3		issubgr.a	. . . . 5 ⊢ 𝐴 = (Vtx‘𝐺)
4		issubgr.i	. . . . 5 ⊢ 𝐼 = (iEdg‘𝑆)
5		issubgr.b	. . . . 5 ⊢ 𝐵 = (iEdg‘𝐺)
6		issubgr.e	. . . . 5 ⊢ 𝐸 = (Edg‘𝑆)
7	2, 3, 4, 5, 6	issubgr 29354	. . . 4 ⊢ ((𝐺 ∈ V ∧ 𝑆 ∈ V) → (𝑆 SubGraph 𝐺 ↔ (𝑉 ⊆ 𝐴 ∧ 𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉)))
8	7	biimpd 229	. . 3 ⊢ ((𝐺 ∈ V ∧ 𝑆 ∈ V) → (𝑆 SubGraph 𝐺 → (𝑉 ⊆ 𝐴 ∧ 𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉)))
9	8	ancoms 458	. 2 ⊢ ((𝑆 ∈ V ∧ 𝐺 ∈ V) → (𝑆 SubGraph 𝐺 → (𝑉 ⊆ 𝐴 ∧ 𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉)))
10	1, 9	mpcom 38	1 ⊢ (𝑆 SubGraph 𝐺 → (𝑉 ⊆ 𝐴 ∧ 𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114  Vcvv 3430   ⊆ wss 3890  𝒫 cpw 4542   class class class wbr 5086  dom cdm 5624   ↾ cres 5626  ‘cfv 6492  Vtxcvtx 29079  iEdgciedg 29080  Edgcedg 29130   SubGraph csubgr 29350

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5231  ax-pr 5370

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-xp 5630  df-rel 5631  df-dm 5634  df-res 5636  df-iota 6448  df-fv 6500  df-subgr 29351

This theorem is referenced by:  subgrprop2  29357  subgrwlk  35330