Theorem bnj207 35511

Description: Technical lemma for bnj852 35551. 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
bnj207.1	⊢ (𝜒 ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
bnj207.2	⊢ (𝜑′ ↔ [𝑀 / 𝑛]𝜑)
bnj207.3	⊢ (𝜓′ ↔ [𝑀 / 𝑛]𝜓)
bnj207.4	⊢ (𝜒′ ↔ [𝑀 / 𝑛]𝜒)
bnj207.5	⊢ 𝑀 ∈ V

Assertion

Ref	Expression
bnj207	⊢ (𝜒′ ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑀 ∧ 𝜑′ ∧ 𝜓′)))

Distinct variable groups:   𝐴,𝑛   𝑓,𝑀   𝑅,𝑛   𝑓,𝑛   𝑥,𝑛

Allowed substitution hints:   𝜑(𝑥, 𝑓, 𝑛)   𝜓(𝑥, 𝑓, 𝑛)   𝜒(𝑥, 𝑓, 𝑛)   𝐴(𝑥, 𝑓)   𝑅(𝑥, 𝑓)   𝑀(𝑥, 𝑛)   𝜑′(𝑥, 𝑓, 𝑛)   𝜓′(𝑥, 𝑓, 𝑛)   𝜒′(𝑥, 𝑓, 𝑛)

Proof of Theorem bnj207

Step	Hyp	Ref	Expression
1		bnj207.4	. 2 ⊢ (𝜒′ ↔ [𝑀 / 𝑛]𝜒)
2		bnj207.1	. . . 4 ⊢ (𝜒 ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
3	2	sbcbii 3794	. . 3 ⊢ ([𝑀 / 𝑛]𝜒 ↔ [𝑀 / 𝑛]((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
4		bnj207.5	. . . . 5 ⊢ 𝑀 ∈ V
5		nfv 1946	. . . . . 6 ⊢ Ⅎ𝑛(𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴)
6	5	sbc19.21g 3809	. . . . 5 ⊢ (𝑀 ∈ V → ([𝑀 / 𝑛]((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → [𝑀 / 𝑛]∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))))
7	4, 6	ax-mp 5	. . . 4 ⊢ ([𝑀 / 𝑛]((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → [𝑀 / 𝑛]∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
8	4	bnj89 35352	. . . . . 6 ⊢ ([𝑀 / 𝑛]∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ ∃!𝑓[𝑀 / 𝑛](𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
9	4	bnj90 35353	. . . . . . . . 9 ⊢ ([𝑀 / 𝑛]𝑓 Fn 𝑛 ↔ 𝑓 Fn 𝑀)
10	9	bicomi 227	. . . . . . . 8 ⊢ (𝑓 Fn 𝑀 ↔ [𝑀 / 𝑛]𝑓 Fn 𝑛)
11		bnj207.2	. . . . . . . 8 ⊢ (𝜑′ ↔ [𝑀 / 𝑛]𝜑)
12		bnj207.3	. . . . . . . 8 ⊢ (𝜓′ ↔ [𝑀 / 𝑛]𝜓)
13	10, 11, 12, 4	bnj206 35362	. . . . . . 7 ⊢ ([𝑀 / 𝑛](𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ (𝑓 Fn 𝑀 ∧ 𝜑′ ∧ 𝜓′))
14	13	eubii 2610	. . . . . 6 ⊢ (∃!𝑓[𝑀 / 𝑛](𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ ∃!𝑓(𝑓 Fn 𝑀 ∧ 𝜑′ ∧ 𝜓′))
15	8, 14	bitri 278	. . . . 5 ⊢ ([𝑀 / 𝑛]∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ ∃!𝑓(𝑓 Fn 𝑀 ∧ 𝜑′ ∧ 𝜓′))
16	15	imbi2i 339	. . . 4 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → [𝑀 / 𝑛]∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑀 ∧ 𝜑′ ∧ 𝜓′)))
17	7, 16	bitri 278	. . 3 ⊢ ([𝑀 / 𝑛]((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑀 ∧ 𝜑′ ∧ 𝜓′)))
18	3, 17	bitri 278	. 2 ⊢ ([𝑀 / 𝑛]𝜒 ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑀 ∧ 𝜑′ ∧ 𝜓′)))
19	1, 18	bitri 278	1 ⊢ (𝜒′ ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑀 ∧ 𝜑′ ∧ 𝜓′)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   ∈ wcel 2144  ∃!weu 2593  Vcvv 3450  [wsbc 3738   Fn wfn 6533   FrSe w-bnj15 35323

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-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-v 3452  df-sbc 3739  df-fn 6541

This theorem is used by:  bnj600  35549  bnj908  35561