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

Theorem upgrspanop 29231
Description: A spanning subgraph of a pseudograph represented by an ordered pair is a pseudograph. (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by AV, 13-Oct-2020.)
Hypotheses
Ref Expression
uhgrspanop.v 𝑉 = (Vtx‘𝐺)
uhgrspanop.e 𝐸 = (iEdg‘𝐺)
Assertion
Ref Expression
upgrspanop (𝐺 ∈ UPGraph → ⟨𝑉, (𝐸𝐴)⟩ ∈ UPGraph)

Proof of Theorem upgrspanop
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 uhgrspanop.v . . . . 5 𝑉 = (Vtx‘𝐺)
2 uhgrspanop.e . . . . 5 𝐸 = (iEdg‘𝐺)
3 vex 3454 . . . . . 6 𝑔 ∈ V
43a1i 11 . . . . 5 ((𝐺 ∈ UPGraph ∧ ((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸𝐴))) → 𝑔 ∈ V)
5 simprl 770 . . . . 5 ((𝐺 ∈ UPGraph ∧ ((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸𝐴))) → (Vtx‘𝑔) = 𝑉)
6 simprr 772 . . . . 5 ((𝐺 ∈ UPGraph ∧ ((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸𝐴))) → (iEdg‘𝑔) = (𝐸𝐴))
7 simpl 482 . . . . 5 ((𝐺 ∈ UPGraph ∧ ((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸𝐴))) → 𝐺 ∈ UPGraph)
81, 2, 4, 5, 6, 7upgrspan 29227 . . . 4 ((𝐺 ∈ UPGraph ∧ ((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸𝐴))) → 𝑔 ∈ UPGraph)
98ex 412 . . 3 (𝐺 ∈ UPGraph → (((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸𝐴)) → 𝑔 ∈ UPGraph))
109alrimiv 1927 . 2 (𝐺 ∈ UPGraph → ∀𝑔(((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸𝐴)) → 𝑔 ∈ UPGraph))
111fvexi 6875 . . 3 𝑉 ∈ V
1211a1i 11 . 2 (𝐺 ∈ UPGraph → 𝑉 ∈ V)
132fvexi 6875 . . . 4 𝐸 ∈ V
1413resex 6003 . . 3 (𝐸𝐴) ∈ V
1514a1i 11 . 2 (𝐺 ∈ UPGraph → (𝐸𝐴) ∈ V)
1610, 12, 15gropeld 28967 1 (𝐺 ∈ UPGraph → ⟨𝑉, (𝐸𝐴)⟩ ∈ UPGraph)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2109  Vcvv 3450  cop 4598  cres 5643  cfv 6514  Vtxcvtx 28930  iEdgciedg 28931  UPGraphcupgr 29014
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-11 2158  ax-12 2178  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pr 5390  ax-un 7714
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 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rab 3409  df-v 3452  df-sbc 3757  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-br 5111  df-opab 5173  df-mpt 5192  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-fv 6522  df-1st 7971  df-2nd 7972  df-vtx 28932  df-iedg 28933  df-edg 28982  df-uhgr 28992  df-upgr 29016  df-subgr 29202
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator