| 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 29367 | . 2 ⊢ (𝑆 SubGraph 𝐺 → (𝑉 ⊆ 𝐴 ∧ 𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉)) |
| 7 | resss 5960 | . . . 4 ⊢ (𝐵 ↾ dom 𝐼) ⊆ 𝐵 | |
| 8 | sseq1 3947 | . . . 4 ⊢ (𝐼 = (𝐵 ↾ dom 𝐼) → (𝐼 ⊆ 𝐵 ↔ (𝐵 ↾ dom 𝐼) ⊆ 𝐵)) | |
| 9 | 7, 8 | mpbiri 259 | . . 3 ⊢ (𝐼 = (𝐵 ↾ dom 𝐼) → 𝐼 ⊆ 𝐵) |
| 10 | 9 | 3anim2i 1159 | . 2 ⊢ ((𝑉 ⊆ 𝐴 ∧ 𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉) → (𝑉 ⊆ 𝐴 ∧ 𝐼 ⊆ 𝐵 ∧ 𝐸 ⊆ 𝒫 𝑉)) |
| 11 | 6, 10 | syl 17 | 1 ⊢ (𝑆 SubGraph 𝐺 → (𝑉 ⊆ 𝐴 ∧ 𝐼 ⊆ 𝐵 ∧ 𝐸 ⊆ 𝒫 𝑉)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1092 = wceq 1547 ⊆ wss 3890 𝒫 cpw 4536 class class class wbr 5079 dom cdm 5625 ↾ cres 5627 ‘cfv 6492 Vtxcvtx 29090 iEdgciedg 29091 Edgcedg 29141 SubGraph csubgr 29361 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2712 ax-sep 5225 ax-pr 5369 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2719 df-cleq 2732 df-clel 2815 df-ral 3055 df-rex 3065 df-rab 3393 df-v 3434 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-br 5080 df-opab 5142 df-xp 5631 df-rel 5632 df-dm 5635 df-res 5637 df-iota 6448 df-fv 6500 df-subgr 29362 |
| This theorem is referenced by: uhgrissubgr 29369 subgrprop3 29370 subgrfun 29375 subgreldmiedg 29377 subgruhgredgd 29378 subumgredg2 29379 subuhgr 29380 subupgr 29381 subumgr 29382 subusgr 29383 subgrwlk 35367 |
| Copyright terms: Public domain | W3C validator |