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

Theorem upgrspanop 29384
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 3435 . . . . . 6 𝑔 ∈ V
43a1i 11 . . . . 5 ((𝐺 ∈ UPGraph ∧ ((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸𝐴))) → 𝑔 ∈ V)
5 simprl 776 . . . . 5 ((𝐺 ∈ UPGraph ∧ ((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸𝐴))) → (Vtx‘𝑔) = 𝑉)
6 simprr 778 . . . . 5 ((𝐺 ∈ UPGraph ∧ ((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸𝐴))) → (iEdg‘𝑔) = (𝐸𝐴))
7 simpl 483 . . . . 5 ((𝐺 ∈ UPGraph ∧ ((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸𝐴))) → 𝐺 ∈ UPGraph)
81, 2, 4, 5, 6, 7upgrspan 29380 . . . 4 ((𝐺 ∈ UPGraph ∧ ((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸𝐴))) → 𝑔 ∈ UPGraph)
98ex 413 . . 3 (𝐺 ∈ UPGraph → (((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸𝐴)) → 𝑔 ∈ UPGraph))
109alrimiv 1934 . 2 (𝐺 ∈ UPGraph → ∀𝑔(((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸𝐴)) → 𝑔 ∈ UPGraph))
111fvexi 6841 . . 3 𝑉 ∈ V
1211a1i 11 . 2 (𝐺 ∈ UPGraph → 𝑉 ∈ V)
132fvexi 6841 . . . 4 𝐸 ∈ V
1413resex 5981 . . 3 (𝐸𝐴) ∈ V
1514a1i 11 . 2 (𝐺 ∈ UPGraph → (𝐸𝐴) ∈ V)
1610, 12, 15gropeld 29120 1 (𝐺 ∈ UPGraph → ⟨𝑉, (𝐸𝐴)⟩ ∈ UPGraph)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1547  wcel 2119  Vcvv 3431  cop 4561  cres 5620  cfv 6485  Vtxcvtx 29083  iEdgciedg 29084  UPGraphcupgr 29167
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-nul 5228  ax-pr 5362  ax-un 7678
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-sbc 3724  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-br 5073  df-opab 5135  df-mpt 5154  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-fv 6493  df-1st 7931  df-2nd 7932  df-vtx 29085  df-iedg 29086  df-edg 29135  df-uhgr 29145  df-upgr 29169  df-subgr 29355
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator