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 38747
Description: Lemma for heibor 38756. 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 2848 . . 3 (𝑦 = 𝐴 → (𝑦 ∈ (𝐹‘𝑛) ↔ 𝐴 ∈ (𝐹‘𝑛)))
4 oveq1 7427 . . . 4 (𝑦 = 𝐴 → (𝑦𝐵𝑛) = (𝐴𝐵𝑛))
54eleq1d 2845 . . 3 (𝑦 = 𝐴 → ((𝑦𝐵𝑛) ∈ 𝐾 ↔ (𝐴𝐵𝑛) ∈ 𝐾))
63, 53anbi23d 1467 . 2 (𝑦 = 𝐴 → ((𝑛 ∈ ℕ0 ∧ 𝑦 ∈ (𝐹‘𝑛) ∧ (𝑦𝐵𝑛) ∈ 𝐾) ↔ (𝑛 ∈ ℕ0 ∧ 𝐴 ∈ (𝐹‘𝑛) ∧ (𝐴𝐵𝑛) ∈ 𝐾)))
7 eleq1 2848 . . 3 (𝑛 = 𝐶 → (𝑛 ∈ ℕ0 ↔ 𝐶 ∈ ℕ0))
8 fveq2 6885 . . . 4 (𝑛 = 𝐶 → (𝐹‘𝑛) = (𝐹‘𝐶))
98eleq2d 2846 . . 3 (𝑛 = 𝐶 → (𝐴 ∈ (𝐹‘𝑛) ↔ 𝐴 ∈ (𝐹‘𝐶)))
10 oveq2 7428 . . . 4 (𝑛 = 𝐶 → (𝐴𝐵𝑛) = (𝐴𝐵𝐶))
1110eleq1d 2845 . . 3 (𝑛 = 𝐶 → ((𝐴𝐵𝑛) ∈ 𝐾 ↔ (𝐴𝐵𝐶) ∈ 𝐾))
127, 9, 113anbi123d 1464 . 2 (𝑛 = 𝐶 → ((𝑛 ∈ ℕ0 ∧ 𝐴 ∈ (𝐹‘𝑛) ∧ (𝐴𝐵𝑛) ∈ 𝐾) ↔ (𝐶 ∈ ℕ0 ∧ 𝐴 ∈ (𝐹‘𝐶) ∧ (𝐴𝐵𝐶) ∈ 𝐾)))
13 heibor.4 . 2 𝐺 = {⟨𝑦, 𝑛⟩ ∣ (𝑛 ∈ ℕ0 ∧ 𝑦 ∈ (𝐹‘𝑛) ∧ (𝑦𝐵𝑛) ∈ 𝐾)}
141, 2, 6, 12, 13brab 5517 1 (𝐴𝐺𝐶 ↔ (𝐶 ∈ ℕ0 ∧ 𝐴 ∈ (𝐹‘𝐶) ∧ (𝐴𝐵𝐶) ∈ 𝐾))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  {cab 2738  ∃wrex 3086  Vcvv 3450   ⊆ wss 3895   ∩ cin 4089  𝒫 cpw 4556  ∪ cuni 4866   class class class wbr 5102  {copab 5166  ‘cfv 6538  (class class class)co 7420  Fincfn 8973  ℕ0cn0 12606  MetOpencmopn 21668
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-sep 5248  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-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-iota 6494  df-fv 6546  df-ov 7423
This theorem is used by:  heiborlem3  38748  heiborlem5  38750  heiborlem6  38751  heiborlem8  38753  heiborlem10  38755
  Copyright terms: Public domain W3C validator