Theorem uhgrspan 29327

Description: A spanning subgraph 𝑆 of a hypergraph 𝐺 is a hypergraph. (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‘𝑆) = (𝐸 ↾ 𝐴))
uhgrspan.g	⊢ (𝜑 → 𝐺 ∈ UHGraph)

Assertion

Ref	Expression
uhgrspan	⊢ (𝜑 → 𝑆 ∈ UHGraph)

Proof of Theorem uhgrspan

Step	Hyp	Ref	Expression
1		uhgrspan.g	. 2 ⊢ (𝜑 → 𝐺 ∈ UHGraph)
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	2, 3, 4, 5, 6, 1	uhgrspansubgr 29326	. 2 ⊢ (𝜑 → 𝑆 SubGraph 𝐺)
8		subuhgr 29321	. 2 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 SubGraph 𝐺) → 𝑆 ∈ UHGraph)
9	1, 7, 8	syl2anc 583	1 ⊢ (𝜑 → 𝑆 ∈ UHGraph)

Syntax hints:   → wi 4   = wceq 1537   ∈ wcel 2108   class class class wbr 5166   ↾ cres 5702  ‘cfv 6573  Vtxcvtx 29031  iEdgciedg 29032  UHGraphcuhgr 29091   SubGraph csubgr 29302

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447  ax-un 7770

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-sbc 3805  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-fv 6581  df-edg 29083  df-uhgr 29093  df-subgr 29303

This theorem is referenced by:  uhgrspanop  29331