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

Theorem vtxdginducedm1lem3 29231
Description: Lemma 3 for vtxdginducedm1 29233: 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 29229 . . . 4 (iEdg‘𝑆) = 𝑃
87, 5eqtri 2759 . . 3 (iEdg‘𝑆) = (𝐸𝐼)
98fveq1i 6892 . 2 ((iEdg‘𝑆)‘𝐻) = ((𝐸𝐼)‘𝐻)
10 fvres 6910 . 2 (𝐻𝐼 → ((𝐸𝐼)‘𝐻) = (𝐸𝐻))
119, 10eqtrid 2783 1 (𝐻𝐼 → ((iEdg‘𝑆)‘𝐻) = (𝐸𝐻))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1540  wcel 2105  wnel 3045  {crab 3431  cdif 3945  {csn 4628  cop 4634  dom cdm 5676  cres 5678  cfv 6543  Vtxcvtx 28689  iEdgciedg 28690
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2702  ax-sep 5299  ax-nul 5306  ax-pr 5427  ax-un 7729
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-rab 3432  df-v 3475  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5574  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-iota 6495  df-fun 6545  df-fv 6551  df-2nd 7980  df-iedg 28692
This theorem is referenced by:  vtxdginducedm1  29233
  Copyright terms: Public domain W3C validator