Theorem heiborlem2 35250

Description: Lemma for heibor 35259. 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

Step	Hyp	Ref	Expression
1		heiborlem2.5	. 2 ⊢ 𝐴 ∈ V
2		heiborlem2.6	. 2 ⊢ 𝐶 ∈ V
3		eleq1 2877	. . 3 ⊢ (𝑦 = 𝐴 → (𝑦 ∈ (𝐹‘𝑛) ↔ 𝐴 ∈ (𝐹‘𝑛)))
4		oveq1 7142	. . . 4 ⊢ (𝑦 = 𝐴 → (𝑦𝐵𝑛) = (𝐴𝐵𝑛))
5	4	eleq1d 2874	. . 3 ⊢ (𝑦 = 𝐴 → ((𝑦𝐵𝑛) ∈ 𝐾 ↔ (𝐴𝐵𝑛) ∈ 𝐾))
6	3, 5	3anbi23d 1436	. 2 ⊢ (𝑦 = 𝐴 → ((𝑛 ∈ ℕ0 ∧ 𝑦 ∈ (𝐹‘𝑛) ∧ (𝑦𝐵𝑛) ∈ 𝐾) ↔ (𝑛 ∈ ℕ0 ∧ 𝐴 ∈ (𝐹‘𝑛) ∧ (𝐴𝐵𝑛) ∈ 𝐾)))
7		eleq1 2877	. . 3 ⊢ (𝑛 = 𝐶 → (𝑛 ∈ ℕ0 ↔ 𝐶 ∈ ℕ0))
8		fveq2 6645	. . . 4 ⊢ (𝑛 = 𝐶 → (𝐹‘𝑛) = (𝐹‘𝐶))
9	8	eleq2d 2875	. . 3 ⊢ (𝑛 = 𝐶 → (𝐴 ∈ (𝐹‘𝑛) ↔ 𝐴 ∈ (𝐹‘𝐶)))
10		oveq2 7143	. . . 4 ⊢ (𝑛 = 𝐶 → (𝐴𝐵𝑛) = (𝐴𝐵𝐶))
11	10	eleq1d 2874	. . 3 ⊢ (𝑛 = 𝐶 → ((𝐴𝐵𝑛) ∈ 𝐾 ↔ (𝐴𝐵𝐶) ∈ 𝐾))
12	7, 9, 11	3anbi123d 1433	. 2 ⊢ (𝑛 = 𝐶 → ((𝑛 ∈ ℕ0 ∧ 𝐴 ∈ (𝐹‘𝑛) ∧ (𝐴𝐵𝑛) ∈ 𝐾) ↔ (𝐶 ∈ ℕ0 ∧ 𝐴 ∈ (𝐹‘𝐶) ∧ (𝐴𝐵𝐶) ∈ 𝐾)))
13		heibor.4	. 2 ⊢ 𝐺 = {⟨𝑦, 𝑛⟩ ∣ (𝑛 ∈ ℕ0 ∧ 𝑦 ∈ (𝐹‘𝑛) ∧ (𝑦𝐵𝑛) ∈ 𝐾)}
14	1, 2, 6, 12, 13	brab 5395	1 ⊢ (𝐴𝐺𝐶 ↔ (𝐶 ∈ ℕ0 ∧ 𝐴 ∈ (𝐹‘𝐶) ∧ (𝐴𝐵𝐶) ∈ 𝐾))

Syntax hints:  ¬ wn 3   ↔ wb 209   ∧ w3a 1084   = wceq 1538   ∈ wcel 2111  {cab 2776  ∃wrex 3107  Vcvv 3441   ∩ cin 3880   ⊆ wss 3881  𝒫 cpw 4497  ∪ cuni 4800   class class class wbr 5030  {copab 5092  ‘cfv 6324  (class class class)co 7135  Fincfn 8492  ℕ₀cn0 11885  MetOpencmopn 20081

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pr 5295

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-v 3443  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-br 5031  df-opab 5093  df-iota 6283  df-fv 6332  df-ov 7138

This theorem is referenced by:  heiborlem3  35251  heiborlem5  35253  heiborlem6  35254  heiborlem8  35256  heiborlem10  35258