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

Theorem upgrn0 29053
Description: An edge is a nonempty subset of vertices. (Contributed by Mario Carneiro, 11-Mar-2015.) (Revised by AV, 10-Oct-2020.)
Hypotheses
Ref Expression
isupgr.v 𝑉 = (Vtx‘𝐺)
isupgr.e 𝐸 = (iEdg‘𝐺)
Assertion
Ref Expression
upgrn0 ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴𝐹𝐴) → (𝐸𝐹) ≠ ∅)

Proof of Theorem upgrn0
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 ssrab2 4033 . . 3 {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ⊆ (𝒫 𝑉 ∖ {∅})
2 isupgr.v . . . . . 6 𝑉 = (Vtx‘𝐺)
3 isupgr.e . . . . . 6 𝐸 = (iEdg‘𝐺)
42, 3upgrfn 29051 . . . . 5 ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴) → 𝐸:𝐴⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
54ffvelcdmda 7022 . . . 4 (((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴) ∧ 𝐹𝐴) → (𝐸𝐹) ∈ {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
653impa 1109 . . 3 ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴𝐹𝐴) → (𝐸𝐹) ∈ {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
71, 6sselid 3935 . 2 ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴𝐹𝐴) → (𝐸𝐹) ∈ (𝒫 𝑉 ∖ {∅}))
8 eldifsni 4744 . 2 ((𝐸𝐹) ∈ (𝒫 𝑉 ∖ {∅}) → (𝐸𝐹) ≠ ∅)
97, 8syl 17 1 ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴𝐹𝐴) → (𝐸𝐹) ≠ ∅)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1540  wcel 2109  wne 2925  {crab 3396  cdif 3902  c0 4286  𝒫 cpw 4553  {csn 4579   class class class wbr 5095   Fn wfn 6481  cfv 6486  cle 11169  2c2 12202  chash 14256  Vtxcvtx 28960  iEdgciedg 28961  UPGraphcupgr 29044
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-12 2178  ax-ext 2701  ax-sep 5238  ax-nul 5248  ax-pr 5374
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3397  df-v 3440  df-sbc 3745  df-dif 3908  df-un 3910  df-ss 3922  df-nul 4287  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4862  df-br 5096  df-opab 5158  df-id 5518  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-fv 6494  df-upgr 29046
This theorem is referenced by:  upgrex  29056
  Copyright terms: Public domain W3C validator