Theorem upgr1wlkdlem2 30742

Description: Lemma 2 for upgr1wlkd 30743. (Contributed by AV, 22-Jan-2021.)

Hypotheses

Ref	Expression
upgr1wlkd.p	⊢ 𝑃 = ⟨“𝑋𝑌”⟩
upgr1wlkd.f	⊢ 𝐹 = ⟨“𝐽”⟩
upgr1wlkd.x	⊢ (𝜑 → 𝑋 ∈ (Vtx‘𝐺))
upgr1wlkd.y	⊢ (𝜑 → 𝑌 ∈ (Vtx‘𝐺))
upgr1wlkd.j	⊢ (𝜑 → ((iEdg‘𝐺)‘𝐽) = {𝑋, 𝑌})

Assertion

Ref	Expression
upgr1wlkdlem2	⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → {𝑋, 𝑌} ⊆ ((iEdg‘𝐺)‘𝐽))

Proof of Theorem upgr1wlkdlem2

Step	Hyp	Ref	Expression
1		upgr1wlkd.j	. 2 ⊢ (𝜑 → ((iEdg‘𝐺)‘𝐽) = {𝑋, 𝑌})
2		ssid 3930	. . 3 ⊢ {𝑋, 𝑌} ⊆ {𝑋, 𝑌}
3		sseq2 3934	. . . 4 ⊢ (((iEdg‘𝐺)‘𝐽) = {𝑋, 𝑌} → ({𝑋, 𝑌} ⊆ ((iEdg‘𝐺)‘𝐽) ↔ {𝑋, 𝑌} ⊆ {𝑋, 𝑌}))
4	3	adantl 487	. . 3 ⊢ (((𝜑 ∧ 𝑋 ≠ 𝑌) ∧ ((iEdg‘𝐺)‘𝐽) = {𝑋, 𝑌}) → ({𝑋, 𝑌} ⊆ ((iEdg‘𝐺)‘𝐽) ↔ {𝑋, 𝑌} ⊆ {𝑋, 𝑌}))
5	2, 4	mpbiri 261	. 2 ⊢ (((𝜑 ∧ 𝑋 ≠ 𝑌) ∧ ((iEdg‘𝐺)‘𝐽) = {𝑋, 𝑌}) → {𝑋, 𝑌} ⊆ ((iEdg‘𝐺)‘𝐽))
6	1, 5	mpidan 702	1 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → {𝑋, 𝑌} ⊆ ((iEdg‘𝐺)‘𝐽))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144   ≠ wne 2955   ⊆ wss 3895  {cpr 4586  ‘cfv 6538  ⟨“cs1 14745  ⟨“cs2 14996  Vtxcvtx 29579  iEdgciedg 29580

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812  df-cleq 2752  df-ss 3896

This theorem is used by:  upgr1wlkd  30743  upgr1trld  30744  upgr1pthd  30745  upgr1pthond  30746