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

Theorem 2wlkdlem7 30526
Description: Lemma 7 for 2wlkd 30530. (Contributed by AV, 14-Feb-2021.)
Hypotheses
Ref Expression
2wlkd.p 𝑃 = ⟨“𝐴𝐵𝐶”⟩
2wlkd.f 𝐹 = ⟨“𝐽𝐾”⟩
2wlkd.s (𝜑 → (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉))
2wlkd.n (𝜑 → (𝐴 ≠ 𝐵 ∧ 𝐵 ≠ 𝐶))
2wlkd.e (𝜑 → ({𝐴, 𝐵} ⊆ (𝐼‘𝐽) ∧ {𝐵, 𝐶} ⊆ (𝐼‘𝐾)))
Assertion
Ref Expression
2wlkdlem7 (𝜑 → (𝐽 ∈ V ∧ 𝐾 ∈ V))

Proof of Theorem 2wlkdlem7
StepHypRef Expression
1 2wlkd.p . . 3 𝑃 = ⟨“𝐴𝐵𝐶”⟩
2 2wlkd.f . . 3 𝐹 = ⟨“𝐽𝐾”⟩
3 2wlkd.s . . 3 (𝜑 → (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉))
4 2wlkd.n . . 3 (𝜑 → (𝐴 ≠ 𝐵 ∧ 𝐵 ≠ 𝐶))
5 2wlkd.e . . 3 (𝜑 → ({𝐴, 𝐵} ⊆ (𝐼‘𝐽) ∧ {𝐵, 𝐶} ⊆ (𝐼‘𝐾)))
61, 2, 3, 4, 52wlkdlem6 30525 . 2 (𝜑 → (𝐵 ∈ (𝐼‘𝐽) ∧ 𝐵 ∈ (𝐼‘𝐾)))
7 elfvex 6920 . . 3 (𝐵 ∈ (𝐼‘𝐽) → 𝐽 ∈ V)
8 elfvex 6920 . . 3 (𝐵 ∈ (𝐼‘𝐾) → 𝐾 ∈ V)
97, 8anim12i 625 . 2 ((𝐵 ∈ (𝐼‘𝐽) ∧ 𝐵 ∈ (𝐼‘𝐾)) → (𝐽 ∈ V ∧ 𝐾 ∈ V))
106, 9syl 18 1 (𝜑 → (𝐽 ∈ V ∧ 𝐾 ∈ V))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144   ≠ wne 2955  Vcvv 3450   ⊆ wss 3895  {cpr 4586  ‘cfv 6538  ⟨“cs2 14996  ⟨“cs3 14997
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-8 2146  ax-9 2154  ax-ext 2732  ax-nul 5259  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-dm 5660  df-iota 6494  df-fv 6546
This theorem is used by:  2wlkdlem8  30527  2trld  30532
  Copyright terms: Public domain W3C validator