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

Theorem ifpsnprss 29659
Description: Lemma for wlkvtxeledg 29660: 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 4032 . . 3 ((𝐴 = 𝐵𝐸 = {𝐴}) → {𝐴} ⊆ {𝐴})
2 preq2 4759 . . . . . 6 (𝐵 = 𝐴 → {𝐴, 𝐵} = {𝐴, 𝐴})
3 dfsn2 4661 . . . . . 6 {𝐴} = {𝐴, 𝐴}
42, 3eqtr4di 2798 . . . . 5 (𝐵 = 𝐴 → {𝐴, 𝐵} = {𝐴})
54eqcoms 2748 . . . 4 (𝐴 = 𝐵 → {𝐴, 𝐵} = {𝐴})
65adantr 480 . . 3 ((𝐴 = 𝐵𝐸 = {𝐴}) → {𝐴, 𝐵} = {𝐴})
7 simpr 484 . . 3 ((𝐴 = 𝐵𝐸 = {𝐴}) → 𝐸 = {𝐴})
81, 6, 73sstr4d 4056 . 2 ((𝐴 = 𝐵𝐸 = {𝐴}) → {𝐴, 𝐵} ⊆ 𝐸)
981fpid3 1082 1 (if-(𝐴 = 𝐵, 𝐸 = {𝐴}, {𝐴, 𝐵} ⊆ 𝐸) → {𝐴, 𝐵} ⊆ 𝐸)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  if-wif 1063   = wceq 1537  wss 3976  {csn 4648  {cpr 4650
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-ifp 1064  df-tru 1540  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-v 3490  df-un 3981  df-ss 3993  df-sn 4649  df-pr 4651
This theorem is referenced by:  wlkvtxeledg  29660
  Copyright terms: Public domain W3C validator