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

Theorem upgr0eopALT 29199
Description: Alternate proof of upgr0eop 29197, using the general theorem gropeld 29116 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 29197). (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 3434 . . . . . 6 𝑔 ∈ V
21a1i 11 . . . . 5 (((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = ∅) → 𝑔 ∈ V)
3 simpr 484 . . . . 5 (((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = ∅) → (iEdg‘𝑔) = ∅)
42, 3upgr0e 29194 . . . 4 (((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = ∅) → 𝑔 ∈ UPGraph)
54ax-gen 1797 . . 3 𝑔(((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = ∅) → 𝑔 ∈ UPGraph)
65a1i 11 . 2 (𝑉𝑊 → ∀𝑔(((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = ∅) → 𝑔 ∈ UPGraph))
7 id 22 . 2 (𝑉𝑊𝑉𝑊)
8 0ex 5242 . . 3 ∅ ∈ V
98a1i 11 . 2 (𝑉𝑊 → ∅ ∈ V)
106, 7, 9gropeld 29116 1 (𝑉𝑊 → ⟨𝑉, ∅⟩ ∈ UPGraph)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wal 1540   = wceq 1542  wcel 2114  Vcvv 3430  c0 4274  cop 4574  cfv 6492  Vtxcvtx 29079  iEdgciedg 29080  UPGraphcupgr 29163
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682  ax-resscn 11086  ax-1cn 11087  ax-icn 11088  ax-addcl 11089  ax-addrcl 11090  ax-mulcl 11091  ax-mulrcl 11092  ax-i2m1 11097  ax-1ne0 11098  ax-rrecex 11101  ax-cnre 11102  ax-pre-lttri 11103
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7363  df-1st 7935  df-2nd 7936  df-er 8636  df-en 8887  df-dom 8888  df-sdom 8889  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-2 12235  df-vtx 29081  df-iedg 29082  df-upgr 29165  df-umgr 29166
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator