Theorem bnj130 35370

Description: Technical lemma for bnj151 35373. 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
bnj130.1	⊢ (𝜃 ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
bnj130.2	⊢ (𝜑′ ↔ [1o / 𝑛]𝜑)
bnj130.3	⊢ (𝜓′ ↔ [1o / 𝑛]𝜓)
bnj130.4	⊢ (𝜃′ ↔ [1o / 𝑛]𝜃)

Assertion

Ref	Expression
bnj130	⊢ (𝜃′ ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)))

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

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

Proof of Theorem bnj130

Step	Hyp	Ref	Expression
1		bnj130.1	. . 3 ⊢ (𝜃 ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
2	1	sbcbii 3798	. 2 ⊢ ([1o / 𝑛]𝜃 ↔ [1o / 𝑛]((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
3		bnj130.4	. 2 ⊢ (𝜃′ ↔ [1o / 𝑛]𝜃)
4		bnj105 35221	. . . . . . . . . 10 ⊢ 1o ∈ V
5	4	bnj90 35219	. . . . . . . . 9 ⊢ ([1o / 𝑛]𝑓 Fn 𝑛 ↔ 𝑓 Fn 1o)
6	5	bicomi 227	. . . . . . . 8 ⊢ (𝑓 Fn 1o ↔ [1o / 𝑛]𝑓 Fn 𝑛)
7		bnj130.2	. . . . . . . 8 ⊢ (𝜑′ ↔ [1o / 𝑛]𝜑)
8		bnj130.3	. . . . . . . 8 ⊢ (𝜓′ ↔ [1o / 𝑛]𝜓)
9	6, 7, 8	3anbi123i 1173	. . . . . . 7 ⊢ ((𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′) ↔ ([1o / 𝑛]𝑓 Fn 𝑛 ∧ [1o / 𝑛]𝜑 ∧ [1o / 𝑛]𝜓))
10		sbc3an 3806	. . . . . . 7 ⊢ ([1o / 𝑛](𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ ([1o / 𝑛]𝑓 Fn 𝑛 ∧ [1o / 𝑛]𝜑 ∧ [1o / 𝑛]𝜓))
11	9, 10	bitr4i 281	. . . . . 6 ⊢ ((𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′) ↔ [1o / 𝑛](𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
12	11	eubii 2612	. . . . 5 ⊢ (∃!𝑓(𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′) ↔ ∃!𝑓[1o / 𝑛](𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
13	4	bnj89 35218	. . . . 5 ⊢ ([1o / 𝑛]∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ ∃!𝑓[1o / 𝑛](𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
14	12, 13	bitr4i 281	. . . 4 ⊢ (∃!𝑓(𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′) ↔ [1o / 𝑛]∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
15	14	imbi2i 339	. . 3 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → [1o / 𝑛]∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
16		nfv 1947	. . . . 5 ⊢ Ⅎ𝑛(𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴)
17	16	sbc19.21g 3813	. . . 4 ⊢ (1o ∈ V → ([1o / 𝑛]((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → [1o / 𝑛]∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))))
18	4, 17	ax-mp 5	. . 3 ⊢ ([1o / 𝑛]((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → [1o / 𝑛]∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
19	15, 18	bitr4i 281	. 2 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) ↔ [1o / 𝑛]((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
20	2, 3, 19	3bitr4i 306	1 ⊢ (𝜃′ ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   ∈ wcel 2145  ∃!weu 2595  Vcvv 3453  [wsbc 3742   Fn wfn 6532  1_oc1o 8451   FrSe w-bnj15 35189

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-ss 3919  df-nul 4283  df-pw 4562  df-sn 4588  df-suc 6367  df-fn 6540  df-1o 8458

This theorem is used by:  bnj151  35373