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

Theorem upgrss 29245
Description: An edge is a subset of vertices. (Contributed by Mario Carneiro, 11-Mar-2015.) (Revised by AV, 29-Nov-2020.)
Hypotheses
Ref Expression
isupgr.v 𝑉 = (Vtx‘𝐺)
isupgr.e 𝐸 = (iEdg‘𝐺)
Assertion
Ref Expression
upgrss ((𝐺 ∈ UPGraph ∧ 𝐹 ∈ dom 𝐸) → (𝐸𝐹) ⊆ 𝑉)

Proof of Theorem upgrss
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 ssrab2 4031 . . . 4 {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ⊆ (𝒫 𝑉 ∖ {∅})
2 difss 4087 . . . 4 (𝒫 𝑉 ∖ {∅}) ⊆ 𝒫 𝑉
31, 2sstri 3943 . . 3 {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ⊆ 𝒫 𝑉
4 isupgr.v . . . . 5 𝑉 = (Vtx‘𝐺)
5 isupgr.e . . . . 5 𝐸 = (iEdg‘𝐺)
64, 5upgrf 29243 . . . 4 (𝐺 ∈ UPGraph → 𝐸:dom 𝐸⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
76ffvelcdmda 7059 . . 3 ((𝐺 ∈ UPGraph ∧ 𝐹 ∈ dom 𝐸) → (𝐸𝐹) ∈ {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
83, 7sselid 3932 . 2 ((𝐺 ∈ UPGraph ∧ 𝐹 ∈ dom 𝐸) → (𝐸𝐹) ∈ 𝒫 𝑉)
98elpwid 4561 1 ((𝐺 ∈ UPGraph ∧ 𝐹 ∈ dom 𝐸) → (𝐸𝐹) ⊆ 𝑉)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1559  wcel 2141  {crab 3413  cdif 3899  wss 3902  c0 4283  𝒫 cpw 4552  {csn 4579   class class class wbr 5097  dom cdm 5643  cfv 6515  cle 11210  2c2 12265  chash 14336  Vtxcvtx 29153  iEdgciedg 29154  UPGraphcupgr 29237
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-12 2211  ax-ext 2733  ax-sep 5243  ax-nul 5253  ax-pr 5387
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-br 5098  df-opab 5160  df-id 5538  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-iota 6471  df-fun 6517  df-fn 6518  df-f 6519  df-fv 6523  df-upgr 29239
This theorem is referenced by:  upgrex  29249  isuspgrim0  48476
  Copyright terms: Public domain W3C validator