Users' Mathboxes Mathbox for Jeff Madsen < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  heiborlem2 Structured version   Visualization version   GIF version

Theorem heiborlem2 38525
Description: Lemma for heibor 38534. Substitutions for the set 𝐺. (Contributed by Jeff Madsen, 23-Jan-2014.)
Hypotheses
Ref Expression
heibor.1 𝐽 = (MetOpen‘𝐷)
heibor.3 𝐾 = {𝑢 ∣ ¬ ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝑢 𝑣}
heibor.4 𝐺 = {⟨𝑦, 𝑛⟩ ∣ (𝑛 ∈ ℕ0𝑦 ∈ (𝐹𝑛) ∧ (𝑦𝐵𝑛) ∈ 𝐾)}
heiborlem2.5 𝐴 ∈ V
heiborlem2.6 𝐶 ∈ V
Assertion
Ref Expression
heiborlem2 (𝐴𝐺𝐶 ↔ (𝐶 ∈ ℕ0𝐴 ∈ (𝐹𝐶) ∧ (𝐴𝐵𝐶) ∈ 𝐾))
Distinct variable groups:   𝑦,𝑛,𝐴   𝑢,𝑛,𝐹,𝑦   𝑣,𝑛,𝐷,𝑢,𝑦   𝐵,𝑛,𝑢,𝑣,𝑦   𝑛,𝐽,𝑢,𝑣,𝑦   𝑈,𝑛,𝑢,𝑣,𝑦   𝐶,𝑛,𝑢,𝑣,𝑦   𝑛,𝐾,𝑦
Allowed substitution hints:   𝐴(𝑣, 𝑢)   𝐹(𝑣)   𝐺(𝑦, 𝑣, 𝑢, 𝑛)   𝐾(𝑣, 𝑢)

Proof of Theorem heiborlem2
StepHypRef Expression
1 heiborlem2.5 . 2 𝐴 ∈ V
2 heiborlem2.6 . 2 𝐶 ∈ V
3 eleq1 2853 . . 3 (𝑦 = 𝐴 → (𝑦 ∈ (𝐹𝑛) ↔ 𝐴 ∈ (𝐹𝑛)))
4 oveq1 7426 . . . 4 (𝑦 = 𝐴 → (𝑦𝐵𝑛) = (𝐴𝐵𝑛))
54eleq1d 2850 . . 3 (𝑦 = 𝐴 → ((𝑦𝐵𝑛) ∈ 𝐾 ↔ (𝐴𝐵𝑛) ∈ 𝐾))
63, 53anbi23d 1467 . 2 (𝑦 = 𝐴 → ((𝑛 ∈ ℕ0𝑦 ∈ (𝐹𝑛) ∧ (𝑦𝐵𝑛) ∈ 𝐾) ↔ (𝑛 ∈ ℕ0𝐴 ∈ (𝐹𝑛) ∧ (𝐴𝐵𝑛) ∈ 𝐾)))
7 eleq1 2853 . . 3 (𝑛 = 𝐶 → (𝑛 ∈ ℕ0𝐶 ∈ ℕ0))
8 fveq2 6885 . . . 4 (𝑛 = 𝐶 → (𝐹𝑛) = (𝐹𝐶))
98eleq2d 2851 . . 3 (𝑛 = 𝐶 → (𝐴 ∈ (𝐹𝑛) ↔ 𝐴 ∈ (𝐹𝐶)))
10 oveq2 7427 . . . 4 (𝑛 = 𝐶 → (𝐴𝐵𝑛) = (𝐴𝐵𝐶))
1110eleq1d 2850 . . 3 (𝑛 = 𝐶 → ((𝐴𝐵𝑛) ∈ 𝐾 ↔ (𝐴𝐵𝐶) ∈ 𝐾))
127, 9, 113anbi123d 1464 . 2 (𝑛 = 𝐶 → ((𝑛 ∈ ℕ0𝐴 ∈ (𝐹𝑛) ∧ (𝐴𝐵𝑛) ∈ 𝐾) ↔ (𝐶 ∈ ℕ0𝐴 ∈ (𝐹𝐶) ∧ (𝐴𝐵𝐶) ∈ 𝐾)))
13 heibor.4 . 2 𝐺 = {⟨𝑦, 𝑛⟩ ∣ (𝑛 ∈ ℕ0𝑦 ∈ (𝐹𝑛) ∧ (𝑦𝐵𝑛) ∈ 𝐾)}
141, 2, 6, 12, 13brab 5530 1 (𝐴𝐺𝐶 ↔ (𝐶 ∈ ℕ0𝐴 ∈ (𝐹𝐶) ∧ (𝐴𝐵𝐶) ∈ 𝐾))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wb 209  w3a 1103   = wceq 1570  wcel 2146  {cab 2743  wrex 3091  Vcvv 3457  cin 3905  wss 3906  𝒫 cpw 4564   cuni 4874   class class class wbr 5111  {copab 5175  cfv 6540  (class class class)co 7419  Fincfn 8949  0cn0 12523  MetOpencmopn 21566
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 2148  ax-9 2156  ax-ext 2737  ax-sep 5259  ax-pr 5406
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-iota 6496  df-fv 6548  df-ov 7422
This theorem is used by:  heiborlem3  38526  heiborlem5  38528  heiborlem6  38529  heiborlem8  38531  heiborlem10  38533
  Copyright terms: Public domain W3C validator