Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > uhgrss | Structured version Visualization version GIF version |
Description: An edge is a subset of vertices. (Contributed by Alexander van der Vekens, 26-Dec-2017.) (Revised by AV, 18-Jan-2020.) |
Ref | Expression |
---|---|
uhgrf.v | ⊢ 𝑉 = (Vtx‘𝐺) |
uhgrf.e | ⊢ 𝐸 = (iEdg‘𝐺) |
Ref | Expression |
---|---|
uhgrss | ⊢ ((𝐺 ∈ UHGraph ∧ 𝐹 ∈ dom 𝐸) → (𝐸‘𝐹) ⊆ 𝑉) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | uhgrf.v | . . . . 5 ⊢ 𝑉 = (Vtx‘𝐺) | |
2 | uhgrf.e | . . . . 5 ⊢ 𝐸 = (iEdg‘𝐺) | |
3 | 1, 2 | uhgrf 25957 | . . . 4 ⊢ (𝐺 ∈ UHGraph → 𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅})) |
4 | 3 | ffvelrnda 6359 | . . 3 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐹 ∈ dom 𝐸) → (𝐸‘𝐹) ∈ (𝒫 𝑉 ∖ {∅})) |
5 | 4 | eldifad 3586 | . 2 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐹 ∈ dom 𝐸) → (𝐸‘𝐹) ∈ 𝒫 𝑉) |
6 | 5 | elpwid 4170 | 1 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐹 ∈ dom 𝐸) → (𝐸‘𝐹) ⊆ 𝑉) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 384 = wceq 1483 ∈ wcel 1990 ∖ cdif 3571 ⊆ wss 3574 ∅c0 3915 𝒫 cpw 4158 {csn 4177 dom cdm 5114 ‘cfv 5888 Vtxcvtx 25874 iEdgciedg 25875 UHGraph cuhgr 25951 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pr 4906 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-sbc 3436 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-opab 4713 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-fv 5896 df-uhgr 25953 |
This theorem is referenced by: lpvtx 25963 umgredgprv 26002 uhgrspansubgrlem 26182 uhgrspan1 26195 |
Copyright terms: Public domain | W3C validator |