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

Theorem vtxdginducedm1lem3 30179
Description: Lemma 3 for vtxdginducedm1 30181: an edge in the induced subgraph 𝑆 of a pseudograph 𝐺 obtained by removing one vertex 𝑁. (Contributed by AV, 16-Dec-2021.)
Hypotheses
Ref Expression
vtxdginducedm1.v 𝑉 = (Vtx‘𝐺)
vtxdginducedm1.e 𝐸 = (iEdg‘𝐺)
vtxdginducedm1.k 𝐾 = (𝑉 ∖ {𝑁})
vtxdginducedm1.i 𝐼 = {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∉ (𝐸‘𝑖)}
vtxdginducedm1.p 𝑃 = (𝐸 ↾ 𝐼)
vtxdginducedm1.s 𝑆 = ⟨𝐾, 𝑃⟩
Assertion
Ref Expression
vtxdginducedm1lem3 (𝐻 ∈ 𝐼 → ((iEdg‘𝑆)‘𝐻) = (𝐸‘𝐻))
Distinct variable group:   𝑖,𝐸
Allowed substitution hints:   𝑃(𝑖)   𝑆(𝑖)   𝐺(𝑖)   𝐻(𝑖)   𝐼(𝑖)   𝐾(𝑖)   𝑁(𝑖)   𝑉(𝑖)

Proof of Theorem vtxdginducedm1lem3
StepHypRef Expression
1 vtxdginducedm1.v . . . . 5 𝑉 = (Vtx‘𝐺)
2 vtxdginducedm1.e . . . . 5 𝐸 = (iEdg‘𝐺)
3 vtxdginducedm1.k . . . . 5 𝐾 = (𝑉 ∖ {𝑁})
4 vtxdginducedm1.i . . . . 5 𝐼 = {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∉ (𝐸‘𝑖)}
5 vtxdginducedm1.p . . . . 5 𝑃 = (𝐸 ↾ 𝐼)
6 vtxdginducedm1.s . . . . 5 𝑆 = ⟨𝐾, 𝑃⟩
71, 2, 3, 4, 5, 6vtxdginducedm1lem1 30177 . . . 4 (iEdg‘𝑆) = 𝑃
87, 5eqtri 2786 . . 3 (iEdg‘𝑆) = (𝐸 ↾ 𝐼)
98fveq1i 6917 . 2 ((iEdg‘𝑆)‘𝐻) = ((𝐸 ↾ 𝐼)‘𝐻)
10 fvres 6935 . 2 (𝐻 ∈ 𝐼 → ((𝐸 ↾ 𝐼)‘𝐻) = (𝐸‘𝐻))
119, 10eqtrid 2810 1 (𝐻 ∈ 𝐼 → ((iEdg‘𝑆)‘𝐻) = (𝐸‘𝐻))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147   ∉ wnel 3065  {crab 3416   ∖ cdif 4048  {csn 4588  ⟨cop 4840  dom cdm 5658   ↾ cres 5660  ‘cfv 6566  Vtxcvtx 29631  iEdgciedg 29632
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-iota 6520  df-fun 6568  df-fv 6574  df-2nd 8036  df-iedg 29634
This theorem is used by:  vtxdginducedm1  30181
  Copyright terms: Public domain W3C validator