Theorem upgr1wlkdlem2 30719

Description: Lemma 2 for upgr1wlkd 30720. (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 3953	. . 3 ⊢ {𝑋, 𝑌} ⊆ {𝑋, 𝑌}
3		sseq2 3957	. . . 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 1570   ∈ wcel 2145   ≠ wne 2956   ⊆ wss 3899  {cpr 4586  ‘cfv 6531  ⟨“cs1 14722  ⟨“cs2 14972  Vtxcvtx 29556  iEdgciedg 29557

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-9 2155  ax-ext 2733

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-cleq 2753  df-ss 3916

This theorem is used by:  upgr1wlkd  30720  upgr1trld  30721  upgr1pthd  30722  upgr1pthond  30723