Theorem ifpprsnss 4740

Description: An unordered pair is a singleton or a subset of itself. This theorem is helpful to convert theorems about walks in arbitrary graphs into theorems about walks in pseudographs. (Contributed by AV, 27-Feb-2021.)

Assertion

Ref	Expression
ifpprsnss	⊢ (𝑃 = {𝐴, 𝐵} → if-(𝐴 = 𝐵, 𝑃 = {𝐴}, {𝐴, 𝐵} ⊆ 𝑃))

Proof of Theorem ifpprsnss

Step	Hyp	Ref	Expression
1		preq2 4710	. . . . . 6 ⊢ (𝐵 = 𝐴 → {𝐴, 𝐵} = {𝐴, 𝐴})
2		dfsn2 4614	. . . . . 6 ⊢ {𝐴} = {𝐴, 𝐴}
3	1, 2	eqtr4di 2788	. . . . 5 ⊢ (𝐵 = 𝐴 → {𝐴, 𝐵} = {𝐴})
4	3	eqcoms 2743	. . . 4 ⊢ (𝐴 = 𝐵 → {𝐴, 𝐵} = {𝐴})
5	4	eqeq2d 2746	. . 3 ⊢ (𝐴 = 𝐵 → (𝑃 = {𝐴, 𝐵} ↔ 𝑃 = {𝐴}))
6	5	biimpac 478	. 2 ⊢ ((𝑃 = {𝐴, 𝐵} ∧ 𝐴 = 𝐵) → 𝑃 = {𝐴})
7		eqimss2 4018	. . 3 ⊢ (𝑃 = {𝐴, 𝐵} → {𝐴, 𝐵} ⊆ 𝑃)
8	7	adantr 480	. 2 ⊢ ((𝑃 = {𝐴, 𝐵} ∧ ¬ 𝐴 = 𝐵) → {𝐴, 𝐵} ⊆ 𝑃)
9	6, 8	ifpimpda 1080	1 ⊢ (𝑃 = {𝐴, 𝐵} → if-(𝐴 = 𝐵, 𝑃 = {𝐴}, {𝐴, 𝐵} ⊆ 𝑃))

Syntax hints:  ¬ wn 3   → wi 4  if-wif 1062   = wceq 1540   ⊆ wss 3926  {csn 4601  {cpr 4603

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2707

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-ifp 1063  df-tru 1543  df-ex 1780  df-sb 2065  df-clab 2714  df-cleq 2727  df-clel 2809  df-v 3461  df-un 3931  df-ss 3943  df-sn 4602  df-pr 4604

This theorem is referenced by:  upgriswlk  29621  eupth2lem3lem7  30215  upwlkwlk  48114