Theorem bnj984 32832

Description: Technical lemma for bnj69 32890. This lemma may no longer be used or have become an indirect lemma of the theorem in question (i.e. a lemma of a lemma... of the theorem). (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)

Hypotheses

Ref	Expression
bnj984.3	⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
bnj984.11	⊢ 𝐵 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)}

Assertion

Ref	Expression
bnj984	⊢ (𝐺 ∈ 𝐴 → (𝐺 ∈ 𝐵 ↔ [𝐺 / 𝑓]∃𝑛𝜒))

Proof of Theorem bnj984

Step	Hyp	Ref	Expression
1		bnj984.11	. . . 4 ⊢ 𝐵 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)}
2	1	eleq2i 2830	. . 3 ⊢ (𝐺 ∈ 𝐵 ↔ 𝐺 ∈ {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)})
3		sbc8g 3719	. . 3 ⊢ (𝐺 ∈ 𝐴 → ([𝐺 / 𝑓]∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ 𝐺 ∈ {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)}))
4	2, 3	bitr4id 289	. 2 ⊢ (𝐺 ∈ 𝐴 → (𝐺 ∈ 𝐵 ↔ [𝐺 / 𝑓]∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
5		df-rex 3069	. . . 4 ⊢ (∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ ∃𝑛(𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
6		bnj984.3	. . . . 5 ⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
7		bnj252 32582	. . . . 5 ⊢ ((𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ (𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
8	6, 7	bitri 274	. . . 4 ⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
9	5, 8	bnj133 32606	. . 3 ⊢ (∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ ∃𝑛𝜒)
10	9	sbcbii 3772	. 2 ⊢ ([𝐺 / 𝑓]∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ [𝐺 / 𝑓]∃𝑛𝜒)
11	4, 10	bitrdi 286	1 ⊢ (𝐺 ∈ 𝐴 → (𝐺 ∈ 𝐵 ↔ [𝐺 / 𝑓]∃𝑛𝜒))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   ∧ w3a 1085   = wceq 1539  ∃wex 1783   ∈ wcel 2108  {cab 2715  ∃wrex 3064  [wsbc 3711   Fn wfn 6413   ∧ w-bnj17 32565

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 396  df-3an 1087  df-tru 1542  df-ex 1784  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-rex 3069  df-sbc 3712  df-bnj17 32566

This theorem is referenced by:  bnj985v  32833  bnj985  32834