Theorem heiborlem2 35105

Description: Lemma for heibor 35114. 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 2900	. . 3 ⊢ (𝑦 = 𝐴 → (𝑦 ∈ (𝐹‘𝑛) ↔ 𝐴 ∈ (𝐹‘𝑛)))
4		oveq1 7163	. . . 4 ⊢ (𝑦 = 𝐴 → (𝑦𝐵𝑛) = (𝐴𝐵𝑛))
5	4	eleq1d 2897	. . 3 ⊢ (𝑦 = 𝐴 → ((𝑦𝐵𝑛) ∈ 𝐾 ↔ (𝐴𝐵𝑛) ∈ 𝐾))
6	3, 5	3anbi23d 1435	. 2 ⊢ (𝑦 = 𝐴 → ((𝑛 ∈ ℕ0 ∧ 𝑦 ∈ (𝐹‘𝑛) ∧ (𝑦𝐵𝑛) ∈ 𝐾) ↔ (𝑛 ∈ ℕ0 ∧ 𝐴 ∈ (𝐹‘𝑛) ∧ (𝐴𝐵𝑛) ∈ 𝐾)))
7		eleq1 2900	. . 3 ⊢ (𝑛 = 𝐶 → (𝑛 ∈ ℕ0 ↔ 𝐶 ∈ ℕ0))
8		fveq2 6670	. . . 4 ⊢ (𝑛 = 𝐶 → (𝐹‘𝑛) = (𝐹‘𝐶))
9	8	eleq2d 2898	. . 3 ⊢ (𝑛 = 𝐶 → (𝐴 ∈ (𝐹‘𝑛) ↔ 𝐴 ∈ (𝐹‘𝐶)))
10		oveq2 7164	. . . 4 ⊢ (𝑛 = 𝐶 → (𝐴𝐵𝑛) = (𝐴𝐵𝐶))
11	10	eleq1d 2897	. . 3 ⊢ (𝑛 = 𝐶 → ((𝐴𝐵𝑛) ∈ 𝐾 ↔ (𝐴𝐵𝐶) ∈ 𝐾))
12	7, 9, 11	3anbi123d 1432	. 2 ⊢ (𝑛 = 𝐶 → ((𝑛 ∈ ℕ0 ∧ 𝐴 ∈ (𝐹‘𝑛) ∧ (𝐴𝐵𝑛) ∈ 𝐾) ↔ (𝐶 ∈ ℕ0 ∧ 𝐴 ∈ (𝐹‘𝐶) ∧ (𝐴𝐵𝐶) ∈ 𝐾)))
13		heibor.4	. 2 ⊢ 𝐺 = {⟨𝑦, 𝑛⟩ ∣ (𝑛 ∈ ℕ0 ∧ 𝑦 ∈ (𝐹‘𝑛) ∧ (𝑦𝐵𝑛) ∈ 𝐾)}
14	1, 2, 6, 12, 13	brab 5430	1 ⊢ (𝐴𝐺𝐶 ↔ (𝐶 ∈ ℕ0 ∧ 𝐴 ∈ (𝐹‘𝐶) ∧ (𝐴𝐵𝐶) ∈ 𝐾))

Syntax hints:  ¬ wn 3   ↔ wb 208   ∧ w3a 1083   = wceq 1537   ∈ wcel 2114  {cab 2799  ∃wrex 3139  Vcvv 3494   ∩ cin 3935   ⊆ wss 3936  𝒫 cpw 4539  ∪ cuni 4838   class class class wbr 5066  {copab 5128  ‘cfv 6355  (class class class)co 7156  Fincfn 8509  ℕ₀cn0 11898  MetOpencmopn 20535

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pr 5330

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-rab 3147  df-v 3496  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-br 5067  df-opab 5129  df-iota 6314  df-fv 6363  df-ov 7159

This theorem is referenced by:  heiborlem3  35106  heiborlem5  35108  heiborlem6  35109  heiborlem8  35111  heiborlem10  35113