| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > subgrprop2 | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| issubgr.v | ⊢ 𝑉 = (Vtx‘𝑆) |
| issubgr.a | ⊢ 𝐴 = (Vtx‘𝐺) |
| issubgr.i | ⊢ 𝐼 = (iEdg‘𝑆) |
| issubgr.b | ⊢ 𝐵 = (iEdg‘𝐺) |
| issubgr.e | ⊢ 𝐸 = (Edg‘𝑆) |
| Ref | Expression |
|---|---|
| subgrprop2 | ⊢ (𝑆 SubGraph 𝐺 → (𝑉 ⊆ 𝐴 ∧ 𝐼 ⊆ 𝐵 ∧ 𝐸 ⊆ 𝒫 𝑉)) |
| Step | Hyp | Ref | 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‘𝑆) | |
| 6 | 1, 2, 3, 4, 5 | subgrprop 29420 | . 2 ⊢ (𝑆 SubGraph 𝐺 → (𝑉 ⊆ 𝐴 ∧ 𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉)) |
| 7 | resss 5985 | . . . 4 ⊢ (𝐵 ↾ dom 𝐼) ⊆ 𝐵 | |
| 8 | sseq1 3961 | . . . 4 ⊢ (𝐼 = (𝐵 ↾ dom 𝐼) → (𝐼 ⊆ 𝐵 ↔ (𝐵 ↾ dom 𝐼) ⊆ 𝐵)) | |
| 9 | 7, 8 | mpbiri 260 | . . 3 ⊢ (𝐼 = (𝐵 ↾ dom 𝐼) → 𝐼 ⊆ 𝐵) |
| 10 | 9 | 3anim2i 1165 | . 2 ⊢ ((𝑉 ⊆ 𝐴 ∧ 𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉) → (𝑉 ⊆ 𝐴 ∧ 𝐼 ⊆ 𝐵 ∧ 𝐸 ⊆ 𝒫 𝑉)) |
| 11 | 6, 10 | syl 17 | 1 ⊢ (𝑆 SubGraph 𝐺 → (𝑉 ⊆ 𝐴 ∧ 𝐼 ⊆ 𝐵 ∧ 𝐸 ⊆ 𝒫 𝑉)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1097 = wceq 1559 ⊆ 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: uhgrissubgr 29422 subgrprop3 29423 subgrfun 29428 subgreldmiedg 29430 subgruhgredgd 29431 subumgredg2 29432 subuhgr 29433 subupgr 29434 subumgr 29435 subusgr 29436 subgrwlk 35446 |
| Copyright terms: Public domain | W3C validator |