| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > issubgr2 | Structured version Visualization version GIF version | ||
| Description: The property of a set to be a subgraph of a set whose edge function is actually a function. (Contributed by AV, 20-Nov-2020.) |
| Ref | Expression |
|---|---|
| issubgr.v | ⊢ 𝑉 = (Vtx‘𝑆) |
| issubgr.a | ⊢ 𝐴 = (Vtx‘𝐺) |
| issubgr.i | ⊢ 𝐼 = (iEdg‘𝑆) |
| issubgr.b | ⊢ 𝐵 = (iEdg‘𝐺) |
| issubgr.e | ⊢ 𝐸 = (Edg‘𝑆) |
| Ref | Expression |
|---|---|
| issubgr2 | ⊢ ((𝐺 ∈ 𝑊 ∧ Fun 𝐵 ∧ 𝑆 ∈ 𝑈) → (𝑆 SubGraph 𝐺 ↔ (𝑉 ⊆ 𝐴 ∧ 𝐼 ⊆ 𝐵 ∧ 𝐸 ⊆ 𝒫 𝑉))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | issubgr.v | . . . 4 ⊢ 𝑉 = (Vtx‘𝑆) | |
| 2 | issubgr.a | . . . 4 ⊢ 𝐴 = (Vtx‘𝐺) | |
| 3 | issubgr.i | . . . 4 ⊢ 𝐼 = (iEdg‘𝑆) | |
| 4 | issubgr.b | . . . 4 ⊢ 𝐵 = (iEdg‘𝐺) | |
| 5 | issubgr.e | . . . 4 ⊢ 𝐸 = (Edg‘𝑆) | |
| 6 | 1, 2, 3, 4, 5 | issubgr 29358 | . . 3 ⊢ ((𝐺 ∈ 𝑊 ∧ 𝑆 ∈ 𝑈) → (𝑆 SubGraph 𝐺 ↔ (𝑉 ⊆ 𝐴 ∧ 𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉))) |
| 7 | 6 | 3adant2 1137 | . 2 ⊢ ((𝐺 ∈ 𝑊 ∧ Fun 𝐵 ∧ 𝑆 ∈ 𝑈) → (𝑆 SubGraph 𝐺 ↔ (𝑉 ⊆ 𝐴 ∧ 𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉))) |
| 8 | resss 5953 | . . . . 5 ⊢ (𝐵 ↾ dom 𝐼) ⊆ 𝐵 | |
| 9 | sseq1 3940 | . . . . 5 ⊢ (𝐼 = (𝐵 ↾ dom 𝐼) → (𝐼 ⊆ 𝐵 ↔ (𝐵 ↾ dom 𝐼) ⊆ 𝐵)) | |
| 10 | 8, 9 | mpbiri 259 | . . . 4 ⊢ (𝐼 = (𝐵 ↾ dom 𝐼) → 𝐼 ⊆ 𝐵) |
| 11 | funssres 6529 | . . . . . . 7 ⊢ ((Fun 𝐵 ∧ 𝐼 ⊆ 𝐵) → (𝐵 ↾ dom 𝐼) = 𝐼) | |
| 12 | 11 | eqcomd 2745 | . . . . . 6 ⊢ ((Fun 𝐵 ∧ 𝐼 ⊆ 𝐵) → 𝐼 = (𝐵 ↾ dom 𝐼)) |
| 13 | 12 | ex 413 | . . . . 5 ⊢ (Fun 𝐵 → (𝐼 ⊆ 𝐵 → 𝐼 = (𝐵 ↾ dom 𝐼))) |
| 14 | 13 | 3ad2ant2 1140 | . . . 4 ⊢ ((𝐺 ∈ 𝑊 ∧ Fun 𝐵 ∧ 𝑆 ∈ 𝑈) → (𝐼 ⊆ 𝐵 → 𝐼 = (𝐵 ↾ dom 𝐼))) |
| 15 | 10, 14 | impbid2 227 | . . 3 ⊢ ((𝐺 ∈ 𝑊 ∧ Fun 𝐵 ∧ 𝑆 ∈ 𝑈) → (𝐼 = (𝐵 ↾ dom 𝐼) ↔ 𝐼 ⊆ 𝐵)) |
| 16 | 15 | 3anbi2d 1449 | . 2 ⊢ ((𝐺 ∈ 𝑊 ∧ Fun 𝐵 ∧ 𝑆 ∈ 𝑈) → ((𝑉 ⊆ 𝐴 ∧ 𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉) ↔ (𝑉 ⊆ 𝐴 ∧ 𝐼 ⊆ 𝐵 ∧ 𝐸 ⊆ 𝒫 𝑉))) |
| 17 | 7, 16 | bitrd 280 | 1 ⊢ ((𝐺 ∈ 𝑊 ∧ Fun 𝐵 ∧ 𝑆 ∈ 𝑈) → (𝑆 SubGraph 𝐺 ↔ (𝑉 ⊆ 𝐴 ∧ 𝐼 ⊆ 𝐵 ∧ 𝐸 ⊆ 𝒫 𝑉))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 ∧ w3a 1092 = wceq 1547 ∈ wcel 2119 ⊆ wss 3883 𝒫 cpw 4529 class class class wbr 5072 dom cdm 5618 ↾ cres 5620 Fun wfun 6479 ‘cfv 6485 Vtxcvtx 29083 iEdgciedg 29084 Edgcedg 29134 SubGraph csubgr 29354 |
| 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-12 2189 ax-ext 2711 ax-sep 5218 ax-pr 5362 |
| 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-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-ral 3054 df-rex 3064 df-rab 3392 df-v 3433 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-br 5073 df-opab 5135 df-id 5513 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-res 5630 df-iota 6441 df-fun 6487 df-fv 6493 df-subgr 29355 |
| This theorem is referenced by: uhgrspansubgr 29378 |
| Copyright terms: Public domain | W3C validator |