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 29753

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 29559	. . . 4 ⊢ (𝐺 ∈ UPGraph → 𝐺 ∈ UHGraph)
8	1, 7	syl 18	. . 3 ⊢ (𝜑 → 𝐺 ∈ UHGraph)
9	2, 3, 4, 5, 6, 8	uhgrspansubgr 29751	. 2 ⊢ (𝜑 → 𝑆 SubGraph 𝐺)
10		subupgr 29747	. 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 2145 class class class wbr 5103 ↾ cres 5657 ‘cfv 6533 Vtxcvtx 29453 iEdgciedg 29454 UHGraphcuhgr 29513 UPGraphcupgr 29537 SubGraph csubgr 29727

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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pr 5398 ax-un 7736

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 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3740 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-fv 6541 df-edg 29505 df-uhgr 29515 df-upgr 29539 df-subgr 29728

This theorem is used by: upgrspanop 29757

W3C validator