Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > uhgrspanop | Structured version Visualization version GIF version |
Description: A spanning subgraph of a hypergraph represented by an ordered pair is a hypergraph. (Contributed by Alexander van der Vekens, 27-Dec-2017.) (Revised by AV, 11-Oct-2020.) |
Ref | Expression |
---|---|
uhgrspanop.v | ⊢ 𝑉 = (Vtx‘𝐺) |
uhgrspanop.e | ⊢ 𝐸 = (iEdg‘𝐺) |
Ref | Expression |
---|---|
uhgrspanop | ⊢ (𝐺 ∈ UHGraph → 〈𝑉, (𝐸 ↾ 𝐴)〉 ∈ UHGraph) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | uhgrspanop.v | . 2 ⊢ 𝑉 = (Vtx‘𝐺) | |
2 | uhgrspanop.e | . 2 ⊢ 𝐸 = (iEdg‘𝐺) | |
3 | opex 5348 | . . 3 ⊢ 〈𝑉, (𝐸 ↾ 𝐴)〉 ∈ V | |
4 | 3 | a1i 11 | . 2 ⊢ (𝐺 ∈ UHGraph → 〈𝑉, (𝐸 ↾ 𝐴)〉 ∈ V) |
5 | 1 | fvexi 6678 | . . . 4 ⊢ 𝑉 ∈ V |
6 | 2 | fvexi 6678 | . . . . 5 ⊢ 𝐸 ∈ V |
7 | 6 | resex 5893 | . . . 4 ⊢ (𝐸 ↾ 𝐴) ∈ V |
8 | 5, 7 | opvtxfvi 26788 | . . 3 ⊢ (Vtx‘〈𝑉, (𝐸 ↾ 𝐴)〉) = 𝑉 |
9 | 8 | a1i 11 | . 2 ⊢ (𝐺 ∈ UHGraph → (Vtx‘〈𝑉, (𝐸 ↾ 𝐴)〉) = 𝑉) |
10 | 5, 7 | opiedgfvi 26789 | . . 3 ⊢ (iEdg‘〈𝑉, (𝐸 ↾ 𝐴)〉) = (𝐸 ↾ 𝐴) |
11 | 10 | a1i 11 | . 2 ⊢ (𝐺 ∈ UHGraph → (iEdg‘〈𝑉, (𝐸 ↾ 𝐴)〉) = (𝐸 ↾ 𝐴)) |
12 | id 22 | . 2 ⊢ (𝐺 ∈ UHGraph → 𝐺 ∈ UHGraph) | |
13 | 1, 2, 4, 9, 11, 12 | uhgrspan 27068 | 1 ⊢ (𝐺 ∈ UHGraph → 〈𝑉, (𝐸 ↾ 𝐴)〉 ∈ UHGraph) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1533 ∈ wcel 2110 Vcvv 3494 〈cop 4566 ↾ cres 5551 ‘cfv 6349 Vtxcvtx 26775 iEdgciedg 26776 UHGraphcuhgr 26835 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3772 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-op 4567 df-uni 4832 df-br 5059 df-opab 5121 df-mpt 5139 df-id 5454 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-fv 6357 df-1st 7683 df-2nd 7684 df-vtx 26777 df-iedg 26778 df-edg 26827 df-uhgr 26837 df-subgr 27044 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |