Theorem ifpsnprss 30001

Description: Lemma for wlkvtxeledg 30002: 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

Step	Hyp	Ref	Expression
1		ssidd 3961	. . 3 ⊢ ((𝐴 = 𝐵 ∧ 𝐸 = {𝐴}) → {𝐴} ⊆ {𝐴})
2		preq2 4702	. . . . . 6 ⊢ (𝐵 = 𝐴 → {𝐴, 𝐵} = {𝐴, 𝐴})
3		dfsn2 4604	. . . . . 6 ⊢ {𝐴} = {𝐴, 𝐴}
4	2, 3	eqtr4di 2818	. . . . 5 ⊢ (𝐵 = 𝐴 → {𝐴, 𝐵} = {𝐴})
5	4	eqcoms 2773	. . . 4 ⊢ (𝐴 = 𝐵 → {𝐴, 𝐵} = {𝐴})
6	5	adantr 486	. . 3 ⊢ ((𝐴 = 𝐵 ∧ 𝐸 = {𝐴}) → {𝐴, 𝐵} = {𝐴})
7		simpr 490	. . 3 ⊢ ((𝐴 = 𝐵 ∧ 𝐸 = {𝐴}) → 𝐸 = {𝐴})
8	1, 6, 7	3sstr4d 3993	. 2 ⊢ ((𝐴 = 𝐵 ∧ 𝐸 = {𝐴}) → {𝐴, 𝐵} ⊆ 𝐸)
9	8	1fpid3 1098	1 ⊢ (if-(𝐴 = 𝐵, 𝐸 = {𝐴}, {𝐴, 𝐵} ⊆ 𝐸) → {𝐴, 𝐵} ⊆ 𝐸)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401  if-wif 1078   = wceq 1570   ⊆ wss 3906  {csn 4591  {cpr 4593

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737

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 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-v 3459  df-un 3911  df-ss 3923  df-sn 4592  df-pr 4594

This theorem is used by:  wlkvtxeledg  30002