upgrspan - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > upgrspan		Structured version Visualization version GIF version

Theorem upgrspan 29931

Description: A spanning subgraph 𝑆 of a pseudograph 𝐺 is a pseudograph. (Contributed by AV, 11-Oct-2020.) (Proof shortened by AV, 18-Nov-2020.)

**Hypotheses**
Ref	Expression
uhgrspan.v	⊢ 𝑉 = (Vtx‘𝐺)
uhgrspan.e	⊢ 𝐸 = (iEdg‘𝐺)
uhgrspan.s	⊢ (𝜑 → 𝑆 ∈ 𝑊)
uhgrspan.q	⊢ (𝜑 → (Vtx‘𝑆) = 𝑉)
uhgrspan.r	⊢ (𝜑 → (iEdg‘𝑆) = (𝐸 ↾ 𝐴))
upgrspan.g	⊢ (𝜑 → 𝐺 ∈ UPGraph)

**Assertion**
Ref	Expression
upgrspan	⊢ (𝜑 → 𝑆 ∈ UPGraph)

**Proof of Theorem upgrspan**
Step	Hyp	Ref	Expression
1		upgrspan.g	. 2 ⊢ (𝜑 → 𝐺 ∈ UPGraph)
2		uhgrspan.v	. . 3 ⊢ 𝑉 = (Vtx‘𝐺)
3		uhgrspan.e	. . 3 ⊢ 𝐸 = (iEdg‘𝐺)
4		uhgrspan.s	. . 3 ⊢ (𝜑 → 𝑆 ∈ 𝑊)
5		uhgrspan.q	. . 3 ⊢ (𝜑 → (Vtx‘𝑆) = 𝑉)
6		uhgrspan.r	. . 3 ⊢ (𝜑 → (iEdg‘𝑆) = (𝐸 ↾ 𝐴))
7		upgruhgr 29737	. . . 4 ⊢ (𝐺 ∈ UPGraph → 𝐺 ∈ UHGraph)
8	1, 7	syl 18	. . 3 ⊢ (𝜑 → 𝐺 ∈ UHGraph)
9	2, 3, 4, 5, 6, 8	uhgrspansubgr 29929	. 2 ⊢ (𝜑 → 𝑆 SubGraph 𝐺)
10		subupgr 29925	. 2 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑆 SubGraph 𝐺) → 𝑆 ∈ UPGraph)
11	1, 9, 10	syl2anc 596	1 ⊢ (𝜑 → 𝑆 ∈ UPGraph)

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 class class class wbr 5108 ↾ cres 5660 ‘cfv 6566 Vtxcvtx 29631 iEdgciedg 29632 UHGraphcuhgr 29691 UPGraphcupgr 29715 SubGraph csubgr 29905

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pr 5398 ax-un 7783

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-fv 6574 df-edg 29683 df-uhgr 29693 df-upgr 29717 df-subgr 29906

This theorem is used by: upgrspanop 29935

W3C validator