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

Theorem upgr0eopALT 29703
Description: Alternate proof of upgr0eop 29701, using the general theorem gropeld 29620 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 29701). (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 29698 . . . 4 (((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = ∅) → 𝑔 ∈ UPGraph)
54ax-gen 1827 . . 3 ∀𝑔(((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = ∅) → 𝑔 ∈ UPGraph)
65a1i 11 . 2 (𝑉 ∈ 𝑊 → ∀𝑔(((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = ∅) → 𝑔 ∈ UPGraph))
7 id 23 . 2 (𝑉 ∈ 𝑊 → 𝑉 ∈ 𝑊)
8 0ex 5260 . . 3 ∅ ∈ V
98a1i 11 . 2 (𝑉 ∈ 𝑊 → ∅ ∈ V)
106, 7, 9gropeld 29620 1 (𝑉 ∈ 𝑊 → ⟨𝑉, ∅⟩ ∈ UPGraph)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1567   = wceq 1569   ∈ wcel 2144  Vcvv 3450  ∅c0 4277  ⟨cop 4834  ‘cfv 6543  Vtxcvtx 29583  iEdgciedg 29584  UPGraphcupgr 29667
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5327  ax-pr 5391  ax-un 7755  ax-resscn 11264  ax-1cn 11265  ax-icn 11266  ax-addcl 11267  ax-addrcl 11268  ax-mulcl 11269  ax-mulrcl 11270  ax-i2m1 11275  ax-1ne0 11276  ax-rrecex 11279  ax-cnre 11280  ax-pre-lttri 11281
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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 3739  df-csb 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7427  df-1st 8005  df-2nd 8006  df-er 8724  df-en 8981  df-dom 8982  df-sdom 8983  df-pnf 11352  df-mnf 11353  df-xr 11354  df-ltxr 11355  df-le 11356  df-2 12412  df-vtx 29585  df-iedg 29586  df-upgr 29669  df-umgr 29670
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator