| 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 29358 | . 2 ⊢ (𝑆 SubGraph 𝐺 → (𝑉 ⊆ 𝐴 ∧ 𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉)) |
| 7 | resss 5968 | . . . 4 ⊢ (𝐵 ↾ dom 𝐼) ⊆ 𝐵 | |
| 8 | sseq1 3961 | . . . 4 ⊢ (𝐼 = (𝐵 ↾ dom 𝐼) → (𝐼 ⊆ 𝐵 ↔ (𝐵 ↾ dom 𝐼) ⊆ 𝐵)) | |
| 9 | 7, 8 | mpbiri 258 | . . 3 ⊢ (𝐼 = (𝐵 ↾ dom 𝐼) → 𝐼 ⊆ 𝐵) |
| 10 | 9 | 3anim2i 1154 | . 2 ⊢ ((𝑉 ⊆ 𝐴 ∧ 𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉) → (𝑉 ⊆ 𝐴 ∧ 𝐼 ⊆ 𝐵 ∧ 𝐸 ⊆ 𝒫 𝑉)) |
| 11 | 6, 10 | syl 17 | 1 ⊢ (𝑆 SubGraph 𝐺 → (𝑉 ⊆ 𝐴 ∧ 𝐼 ⊆ 𝐵 ∧ 𝐸 ⊆ 𝒫 𝑉)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1087 = wceq 1542 ⊆ wss 3903 𝒫 cpw 4556 class class class wbr 5100 dom cdm 5632 ↾ cres 5634 ‘cfv 6500 Vtxcvtx 29081 iEdgciedg 29082 Edgcedg 29132 SubGraph csubgr 29352 |
| 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 5243 ax-pr 5379 |
| 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 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-xp 5638 df-rel 5639 df-dm 5642 df-res 5644 df-iota 6456 df-fv 6508 df-subgr 29353 |
| This theorem is referenced by: uhgrissubgr 29360 subgrprop3 29361 subgrfun 29366 subgreldmiedg 29368 subgruhgredgd 29369 subumgredg2 29370 subuhgr 29371 subupgr 29372 subumgr 29373 subusgr 29374 subgrwlk 35345 |
| Copyright terms: Public domain | W3C validator |