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

Theorem 1wlkdlem2 30711
Description: Lemma 2 for 1wlkd 30714. (Contributed by AV, 22-Jan-2021.)
Hypotheses
Ref Expression
1wlkd.p 𝑃 = ⟨“𝑋𝑌”⟩
1wlkd.f 𝐹 = ⟨“𝐽”⟩
1wlkd.x (𝜑 → 𝑋 ∈ 𝑉)
1wlkd.y (𝜑 → 𝑌 ∈ 𝑉)
1wlkd.l ((𝜑 ∧ 𝑋 = 𝑌) → (𝐼‘𝐽) = {𝑋})
1wlkd.j ((𝜑 ∧ 𝑋 ≠ 𝑌) → {𝑋, 𝑌} ⊆ (𝐼‘𝐽))
Assertion
Ref Expression
1wlkdlem2 (𝜑 → 𝑋 ∈ (𝐼‘𝐽))

Proof of Theorem 1wlkdlem2
StepHypRef Expression
1 1wlkd.x . . . . 5 (𝜑 → 𝑋 ∈ 𝑉)
2 snidg 4621 . . . . 5 (𝑋 ∈ 𝑉 → 𝑋 ∈ {𝑋})
31, 2syl 18 . . . 4 (𝜑 → 𝑋 ∈ {𝑋})
43adantr 486 . . 3 ((𝜑 ∧ 𝑋 = 𝑌) → 𝑋 ∈ {𝑋})
5 1wlkd.l . . 3 ((𝜑 ∧ 𝑋 = 𝑌) → (𝐼‘𝐽) = {𝑋})
64, 5eleqtrrd 2864 . 2 ((𝜑 ∧ 𝑋 = 𝑌) → 𝑋 ∈ (𝐼‘𝐽))
7 1wlkd.j . . . 4 ((𝜑 ∧ 𝑋 ≠ 𝑌) → {𝑋, 𝑌} ⊆ (𝐼‘𝐽))
8 1wlkd.y . . . . . 6 (𝜑 → 𝑌 ∈ 𝑉)
98adantr 486 . . . . 5 ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑌 ∈ 𝑉)
10 prssg 4780 . . . . 5 ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ((𝑋 ∈ (𝐼‘𝐽) ∧ 𝑌 ∈ (𝐼‘𝐽)) ↔ {𝑋, 𝑌} ⊆ (𝐼‘𝐽)))
111, 9, 10syl2an2r 698 . . . 4 ((𝜑 ∧ 𝑋 ≠ 𝑌) → ((𝑋 ∈ (𝐼‘𝐽) ∧ 𝑌 ∈ (𝐼‘𝐽)) ↔ {𝑋, 𝑌} ⊆ (𝐼‘𝐽)))
127, 11mpbird 260 . . 3 ((𝜑 ∧ 𝑋 ≠ 𝑌) → (𝑋 ∈ (𝐼‘𝐽) ∧ 𝑌 ∈ (𝐼‘𝐽)))
1312simpld 500 . 2 ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑋 ∈ (𝐼‘𝐽))
146, 13pm2.61dane 3043 1 (𝜑 → 𝑋 ∈ (𝐼‘𝐽))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ≠ wne 2956   ⊆ wss 3899  {csn 4584  {cpr 4586  ‘cfv 6531  ⟨“cs1 14722  ⟨“cs2 14972
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 2147  ax-9 2155  ax-ext 2733
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-v 3453  df-un 3904  df-ss 3916  df-sn 4585  df-pr 4587
This theorem is used by:  1wlkdlem3  30712  1wlkdlem4  30713
  Copyright terms: Public domain W3C validator