| 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 29864 | . . 3 ⊢ ((𝐺 ∈ 𝑊 ∧ 𝑆 ∈ 𝑈) → (𝑆 SubGraph 𝐺 ↔ (𝑉 ⊆ 𝐴 ∧ 𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉))) |
| 7 | 6 | 3adant2 1149 | . 2 ⊢ ((𝐺 ∈ 𝑊 ∧ Fun 𝐵 ∧ 𝑆 ∈ 𝑈) → (𝑆 SubGraph 𝐺 ↔ (𝑉 ⊆ 𝐴 ∧ 𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉))) |
| 8 | resss 5996 | . . . . 5 ⊢ (𝐵 ↾ dom 𝐼) ⊆ 𝐵 | |
| 9 | sseq1 3937 | . . . . 5 ⊢ (𝐼 = (𝐵 ↾ dom 𝐼) → (𝐼 ⊆ 𝐵 ↔ (𝐵 ↾ dom 𝐼) ⊆ 𝐵)) | |
| 10 | 8, 9 | mpbiri 261 | . . . 4 ⊢ (𝐼 = (𝐵 ↾ dom 𝐼) → 𝐼 ⊆ 𝐵) |
| 11 | funssres 6592 | . . . . . . 7 ⊢ ((Fun 𝐵 ∧ 𝐼 ⊆ 𝐵) → (𝐵 ↾ dom 𝐼) = 𝐼) | |
| 12 | 11 | eqcomd 2769 | . . . . . 6 ⊢ ((Fun 𝐵 ∧ 𝐼 ⊆ 𝐵) → 𝐼 = (𝐵 ↾ dom 𝐼)) |
| 13 | 12 | ex 418 | . . . . 5 ⊢ (Fun 𝐵 → (𝐼 ⊆ 𝐵 → 𝐼 = (𝐵 ↾ dom 𝐼))) |
| 14 | 13 | 3ad2ant2 1152 | . . . 4 ⊢ ((𝐺 ∈ 𝑊 ∧ Fun 𝐵 ∧ 𝑆 ∈ 𝑈) → (𝐼 ⊆ 𝐵 → 𝐼 = (𝐵 ↾ dom 𝐼))) |
| 15 | 10, 14 | impbid2 229 | . . 3 ⊢ ((𝐺 ∈ 𝑊 ∧ Fun 𝐵 ∧ 𝑆 ∈ 𝑈) → (𝐼 = (𝐵 ↾ dom 𝐼) ↔ 𝐼 ⊆ 𝐵)) |
| 16 | 15 | 3anbi2d 1469 | . 2 ⊢ ((𝐺 ∈ 𝑊 ∧ Fun 𝐵 ∧ 𝑆 ∈ 𝑈) → ((𝑉 ⊆ 𝐴 ∧ 𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉) ↔ (𝑉 ⊆ 𝐴 ∧ 𝐼 ⊆ 𝐵 ∧ 𝐸 ⊆ 𝒫 𝑉))) |
| 17 | 7, 16 | bitrd 282 | 1 ⊢ ((𝐺 ∈ 𝑊 ∧ Fun 𝐵 ∧ 𝑆 ∈ 𝑈) → (𝑆 SubGraph 𝐺 ↔ (𝑉 ⊆ 𝐴 ∧ 𝐼 ⊆ 𝐵 ∧ 𝐸 ⊆ 𝒫 𝑉))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2146 ⊆ wss 3899 𝒫 cpw 4559 class class class wbr 5105 dom cdm 5654 ↾ cres 5656 Fun wfun 6540 ‘cfv 6546 Vtxcvtx 29586 iEdgciedg 29587 Edgcedg 29637 SubGraph csubgr 29860 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-12 2215 ax-ext 2735 ax-sep 5251 ax-pr 5394 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3080 df-rex 3090 df-rab 3416 df-v 3455 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4838 df-uni 4870 df-br 5106 df-opab 5170 df-id 5549 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-res 5666 df-iota 6500 df-fun 6548 df-fv 6554 df-subgr 29861 |
| This theorem is used by: uhgrspansubgr 29884 |
| Copyright terms: Public domain | W3C validator |