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

Theorem upgr0eopALT 29573
Description: Alternate proof of upgr0eop 29571, using the general theorem gropeld 29490 to transform a theorem for an arbitrary representation of a graph into a theorem for a graph represented as ordered pair. This general approach causes some overhead, which makes the proof longer than necessary (see proof of upgr0eop 29571). (Contributed by AV, 11-Oct-2020.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
upgr0eopALT (𝑉𝑊 → ⟨𝑉, ∅⟩ ∈ UPGraph)

Proof of Theorem upgr0eopALT
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 vex 3454 . . . . . 6 𝑔 ∈ V
21a1i 11 . . . . 5 (((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = ∅) → 𝑔 ∈ V)
3 simpr 490 . . . . 5 (((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = ∅) → (iEdg‘𝑔) = ∅)
42, 3upgr0e 29568 . . . 4 (((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = ∅) → 𝑔 ∈ UPGraph)
54ax-gen 1828 . . 3 𝑔(((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = ∅) → 𝑔 ∈ UPGraph)
65a1i 11 . 2 (𝑉𝑊 → ∀𝑔(((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = ∅) → 𝑔 ∈ UPGraph))
7 id 23 . 2 (𝑉𝑊𝑉𝑊)
8 0ex 5264 . . 3 ∅ ∈ V
98a1i 11 . 2 (𝑉𝑊 → ∅ ∈ V)
106, 7, 9gropeld 29490 1 (𝑉𝑊 → ⟨𝑉, ∅⟩ ∈ UPGraph)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401  wal 1568   = wceq 1570  wcel 2145  Vcvv 3450  c0 4279  cop 4590  cfv 6533  Vtxcvtx 29453  iEdgciedg 29454  UPGraphcupgr 29537
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-pow 5330  ax-pr 5398  ax-un 7736  ax-resscn 11181  ax-1cn 11182  ax-icn 11183  ax-addcl 11184  ax-addrcl 11185  ax-mulcl 11186  ax-mulrcl 11187  ax-i2m1 11192  ax-1ne0 11193  ax-rrecex 11196  ax-cnre 11197  ax-pre-lttri 11198
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-nel 3062  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  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-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7416  df-1st 7986  df-2nd 7987  df-er 8696  df-en 8953  df-dom 8954  df-sdom 8955  df-pnf 11269  df-mnf 11270  df-xr 11271  df-ltxr 11272  df-le 11273  df-2 12327  df-vtx 29455  df-iedg 29456  df-upgr 29539  df-umgr 29540
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator