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

Theorem upgrn0 28782
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 4077 . . 3 {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ⊆ (𝒫 𝑉 ∖ {∅})
2 isupgr.v . . . . . 6 𝑉 = (Vtx‘𝐺)
3 isupgr.e . . . . . 6 𝐸 = (iEdg‘𝐺)
42, 3upgrfn 28780 . . . . 5 ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴) → 𝐸:𝐴⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
54ffvelcdmda 7086 . . . 4 (((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴) ∧ 𝐹𝐴) → (𝐸𝐹) ∈ {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
653impa 1109 . . 3 ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴𝐹𝐴) → (𝐸𝐹) ∈ {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
71, 6sselid 3980 . 2 ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴𝐹𝐴) → (𝐸𝐹) ∈ (𝒫 𝑉 ∖ {∅}))
8 eldifsni 4793 . 2 ((𝐸𝐹) ∈ (𝒫 𝑉 ∖ {∅}) → (𝐸𝐹) ≠ ∅)
97, 8syl 17 1 ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴𝐹𝐴) → (𝐸𝐹) ≠ ∅)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1540  wcel 2105  wne 2939  {crab 3431  cdif 3945  c0 4322  𝒫 cpw 4602  {csn 4628   class class class wbr 5148   Fn wfn 6538  cfv 6543  cle 11256  2c2 12274  chash 14297  Vtxcvtx 28689  iEdgciedg 28690  UPGraphcupgr 28773
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-12 2170  ax-ext 2702  ax-sep 5299  ax-nul 5306  ax-pr 5427
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-ne 2940  df-ral 3061  df-rex 3070  df-rab 3432  df-v 3475  df-sbc 3778  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-br 5149  df-opab 5211  df-id 5574  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-fv 6551  df-upgr 28775
This theorem is referenced by:  upgrex  28785
  Copyright terms: Public domain W3C validator