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

Theorem umgrares 25853
 Description: A subgraph of a graph (formed by removing some edges from the original graph) is a graph. (Contributed by Mario Carneiro, 12-Mar-2015.)
Assertion
Ref Expression
umgrares (𝑉 UMGrph 𝐸𝑉 UMGrph (𝐸𝐴))

Proof of Theorem umgrares
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 umgraf2 25846 . . . 4 (𝑉 UMGrph 𝐸𝐸:dom 𝐸⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2})
2 resss 5342 . . . . 5 (𝐸𝐴) ⊆ 𝐸
3 dmss 5245 . . . . 5 ((𝐸𝐴) ⊆ 𝐸 → dom (𝐸𝐴) ⊆ dom 𝐸)
42, 3mp1i 13 . . . 4 (𝑉 UMGrph 𝐸 → dom (𝐸𝐴) ⊆ dom 𝐸)
51, 4fssresd 5984 . . 3 (𝑉 UMGrph 𝐸 → (𝐸 ↾ dom (𝐸𝐴)):dom (𝐸𝐴)⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2})
6 resdmres 5543 . . . 4 (𝐸 ↾ dom (𝐸𝐴)) = (𝐸𝐴)
76feq1i 5949 . . 3 ((𝐸 ↾ dom (𝐸𝐴)):dom (𝐸𝐴)⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2} ↔ (𝐸𝐴):dom (𝐸𝐴)⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2})
85, 7sylib 207 . 2 (𝑉 UMGrph 𝐸 → (𝐸𝐴):dom (𝐸𝐴)⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2})
9 relumgra 25843 . . . 4 Rel UMGrph
109brrelexi 5082 . . 3 (𝑉 UMGrph 𝐸𝑉 ∈ V)
119brrelex2i 5083 . . . 4 (𝑉 UMGrph 𝐸𝐸 ∈ V)
12 resexg 5362 . . . 4 (𝐸 ∈ V → (𝐸𝐴) ∈ V)
1311, 12syl 17 . . 3 (𝑉 UMGrph 𝐸 → (𝐸𝐴) ∈ V)
14 isumgra 25844 . . 3 ((𝑉 ∈ V ∧ (𝐸𝐴) ∈ V) → (𝑉 UMGrph (𝐸𝐴) ↔ (𝐸𝐴):dom (𝐸𝐴)⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2}))
1510, 13, 14syl2anc 691 . 2 (𝑉 UMGrph 𝐸 → (𝑉 UMGrph (𝐸𝐴) ↔ (𝐸𝐴):dom (𝐸𝐴)⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2}))
168, 15mpbird 246 1 (𝑉 UMGrph 𝐸𝑉 UMGrph (𝐸𝐴))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 195   ∈ wcel 1977  {crab 2900  Vcvv 3173   ∖ cdif 3537   ⊆ wss 3540  ∅c0 3874  𝒫 cpw 4108  {csn 4125   class class class wbr 4583  dom cdm 5038   ↾ cres 5040  ⟶wf 5800  ‘cfv 5804   ≤ cle 9954  2c2 10947  #chash 12979   UMGrph cumg 25841 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-br 4584  df-opab 4644  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-fun 5806  df-fn 5807  df-f 5808  df-umgra 25842 This theorem is referenced by:  eupares  26502  eupath2lem3  26506
 Copyright terms: Public domain W3C validator