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

Theorem ifpsnprss 30260
Description: Lemma for wlkvtxeledg 30261: Two adjacent (not necessarily different) vertices 𝐴 and 𝐵 in a walk are incident with an edge 𝐸. (Contributed by AV, 4-Apr-2021.) (Revised by AV, 5-Nov-2021.)
Assertion
Ref Expression
ifpsnprss (if-(𝐴 = 𝐵, 𝐸 = {𝐴}, {𝐴, 𝐵} ⊆ 𝐸) → {𝐴, 𝐵} ⊆ 𝐸)

Proof of Theorem ifpsnprss
StepHypRef Expression
1 ssidd 3936 . . 3 ((𝐴 = 𝐵 ∧ 𝐸 = {𝐴}) → {𝐴} ⊆ {𝐴})
2 preq2 4697 . . . . . 6 (𝐵 = 𝐴 → {𝐴, 𝐵} = {𝐴, 𝐴})
3 dfsn2 4597 . . . . . 6 {𝐴} = {𝐴, 𝐴}
42, 3eqtr4di 2816 . . . . 5 (𝐵 = 𝐴 → {𝐴, 𝐵} = {𝐴})
54eqcoms 2771 . . . 4 (𝐴 = 𝐵 → {𝐴, 𝐵} = {𝐴})
65adantr 486 . . 3 ((𝐴 = 𝐵 ∧ 𝐸 = {𝐴}) → {𝐴, 𝐵} = {𝐴})
7 simpr 490 . . 3 ((𝐴 = 𝐵 ∧ 𝐸 = {𝐴}) → 𝐸 = {𝐴})
81, 6, 73sstr4d 3968 . 2 ((𝐴 = 𝐵 ∧ 𝐸 = {𝐴}) → {𝐴, 𝐵} ⊆ 𝐸)
981fpid3 1098 1 (if-(𝐴 = 𝐵, 𝐸 = {𝐴}, {𝐴, 𝐵} ⊆ 𝐸) → {𝐴, 𝐵} ⊆ 𝐸)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401  if-wif 1078   = wceq 1570   ⊆ wss 3900  {csn 4588  {cpr 4590
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-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ifp 1079  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-v 3456  df-ss 3901  df-un 4154  df-sn 4589  df-pr 4591
This theorem is used by:  wlkvtxeledg  30261
  Copyright terms: Public domain W3C validator