| 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 29601 | . 2 ⊢ (𝑆 SubGraph 𝐺 → (𝑉 ⊆ 𝐴 ∧ 𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉)) |
| 7 | resss 6002 | . . . 4 ⊢ (𝐵 ↾ dom 𝐼) ⊆ 𝐵 | |
| 8 | sseq1 3963 | . . . 4 ⊢ (𝐼 = (𝐵 ↾ dom 𝐼) → (𝐼 ⊆ 𝐵 ↔ (𝐵 ↾ dom 𝐼) ⊆ 𝐵)) | |
| 9 | 7, 8 | mpbiri 261 | . . 3 ⊢ (𝐼 = (𝐵 ↾ dom 𝐼) → 𝐼 ⊆ 𝐵) |
| 10 | 9 | 3anim2i 1171 | . 2 ⊢ ((𝑉 ⊆ 𝐴 ∧ 𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉) → (𝑉 ⊆ 𝐴 ∧ 𝐼 ⊆ 𝐵 ∧ 𝐸 ⊆ 𝒫 𝑉)) |
| 11 | 6, 10 | syl 18 | 1 ⊢ (𝑆 SubGraph 𝐺 → (𝑉 ⊆ 𝐴 ∧ 𝐼 ⊆ 𝐵 ∧ 𝐸 ⊆ 𝒫 𝑉)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1103 = wceq 1570 ⊆ wss 3906 𝒫 cpw 4563 class class class wbr 5110 dom cdm 5663 ↾ cres 5665 ‘cfv 6538 Vtxcvtx 29324 iEdgciedg 29325 Edgcedg 29375 SubGraph csubgr 29595 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5258 ax-pr 5406 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-br 5111 df-opab 5175 df-xp 5669 df-rel 5670 df-dm 5673 df-res 5675 df-iota 6494 df-fv 6546 df-subgr 29596 |
| This theorem is referenced by: uhgrissubgr 29603 subgrprop3 29604 subgrfun 29609 subgreldmiedg 29611 subgruhgredgd 29612 subumgredg2 29613 subuhgr 29614 subupgr 29615 subumgr 29616 subusgr 29617 subgrwlk 35602 |
| Copyright terms: Public domain | W3C validator |