| 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 29250 | . . 3 ⊢ ((𝐺 ∈ 𝑊 ∧ 𝑆 ∈ 𝑈) → (𝑆 SubGraph 𝐺 ↔ (𝑉 ⊆ 𝐴 ∧ 𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉))) |
| 7 | 6 | 3adant2 1131 | . 2 ⊢ ((𝐺 ∈ 𝑊 ∧ Fun 𝐵 ∧ 𝑆 ∈ 𝑈) → (𝑆 SubGraph 𝐺 ↔ (𝑉 ⊆ 𝐴 ∧ 𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉))) |
| 8 | resss 5988 | . . . . 5 ⊢ (𝐵 ↾ dom 𝐼) ⊆ 𝐵 | |
| 9 | sseq1 3984 | . . . . 5 ⊢ (𝐼 = (𝐵 ↾ dom 𝐼) → (𝐼 ⊆ 𝐵 ↔ (𝐵 ↾ dom 𝐼) ⊆ 𝐵)) | |
| 10 | 8, 9 | mpbiri 258 | . . . 4 ⊢ (𝐼 = (𝐵 ↾ dom 𝐼) → 𝐼 ⊆ 𝐵) |
| 11 | funssres 6580 | . . . . . . 7 ⊢ ((Fun 𝐵 ∧ 𝐼 ⊆ 𝐵) → (𝐵 ↾ dom 𝐼) = 𝐼) | |
| 12 | 11 | eqcomd 2741 | . . . . . 6 ⊢ ((Fun 𝐵 ∧ 𝐼 ⊆ 𝐵) → 𝐼 = (𝐵 ↾ dom 𝐼)) |
| 13 | 12 | ex 412 | . . . . 5 ⊢ (Fun 𝐵 → (𝐼 ⊆ 𝐵 → 𝐼 = (𝐵 ↾ dom 𝐼))) |
| 14 | 13 | 3ad2ant2 1134 | . . . 4 ⊢ ((𝐺 ∈ 𝑊 ∧ Fun 𝐵 ∧ 𝑆 ∈ 𝑈) → (𝐼 ⊆ 𝐵 → 𝐼 = (𝐵 ↾ dom 𝐼))) |
| 15 | 10, 14 | impbid2 226 | . . 3 ⊢ ((𝐺 ∈ 𝑊 ∧ Fun 𝐵 ∧ 𝑆 ∈ 𝑈) → (𝐼 = (𝐵 ↾ dom 𝐼) ↔ 𝐼 ⊆ 𝐵)) |
| 16 | 15 | 3anbi2d 1443 | . 2 ⊢ ((𝐺 ∈ 𝑊 ∧ Fun 𝐵 ∧ 𝑆 ∈ 𝑈) → ((𝑉 ⊆ 𝐴 ∧ 𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉) ↔ (𝑉 ⊆ 𝐴 ∧ 𝐼 ⊆ 𝐵 ∧ 𝐸 ⊆ 𝒫 𝑉))) |
| 17 | 7, 16 | bitrd 279 | 1 ⊢ ((𝐺 ∈ 𝑊 ∧ Fun 𝐵 ∧ 𝑆 ∈ 𝑈) → (𝑆 SubGraph 𝐺 ↔ (𝑉 ⊆ 𝐴 ∧ 𝐼 ⊆ 𝐵 ∧ 𝐸 ⊆ 𝒫 𝑉))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2108 ⊆ wss 3926 𝒫 cpw 4575 class class class wbr 5119 dom cdm 5654 ↾ cres 5656 Fun wfun 6525 ‘cfv 6531 Vtxcvtx 28975 iEdgciedg 28976 Edgcedg 29026 SubGraph csubgr 29246 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-12 2177 ax-ext 2707 ax-sep 5266 ax-nul 5276 ax-pr 5402 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-ral 3052 df-rex 3061 df-rab 3416 df-v 3461 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-br 5120 df-opab 5182 df-id 5548 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-res 5666 df-iota 6484 df-fun 6533 df-fv 6539 df-subgr 29247 |
| This theorem is referenced by: uhgrspansubgr 29270 |
| Copyright terms: Public domain | W3C validator |