Theorem subgrprop 29420

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 29417	. 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 29418	. . . 4 ⊢ ((𝐺 ∈ V ∧ 𝑆 ∈ V) → (𝑆 SubGraph 𝐺 ↔ (𝑉 ⊆ 𝐴 ∧ 𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉)))
8	7	biimpd 231	. . 3 ⊢ ((𝐺 ∈ V ∧ 𝑆 ∈ V) → (𝑆 SubGraph 𝐺 → (𝑉 ⊆ 𝐴 ∧ 𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉)))
9	8	ancoms 462	. 2 ⊢ ((𝑆 ∈ V ∧ 𝐺 ∈ V) → (𝑆 SubGraph 𝐺 → (𝑉 ⊆ 𝐴 ∧ 𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉)))
10	1, 9	mpcom 38	1 ⊢ (𝑆 SubGraph 𝐺 → (𝑉 ⊆ 𝐴 ∧ 𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉))

Syntax hints:   → wi 4   ∧ wa 399   ∧ w3a 1097   = wceq 1559   ∈ wcel 2141  Vcvv 3453   ⊆ wss 3904  𝒫 cpw 4554   class class class wbr 5099  dom cdm 5645   ↾ cres 5647  ‘cfv 6517  Vtxcvtx 29143  iEdgciedg 29144  Edgcedg 29194   SubGraph csubgr 29414

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-ext 2733  ax-sep 5245  ax-pr 5389

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-sb 2090  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-xp 5651  df-rel 5652  df-dm 5655  df-res 5657  df-iota 6473  df-fv 6525  df-subgr 29415

This theorem is referenced by:  subgrprop2  29421  subgrwlk  35446