Theorem bnj1040 35468

Description: Technical lemma for bnj69 35506. 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
bnj1040.1	⊢ (𝜑′ ↔ [𝑗 / 𝑖]𝜑)
bnj1040.2	⊢ (𝜓′ ↔ [𝑗 / 𝑖]𝜓)
bnj1040.3	⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
bnj1040.4	⊢ (𝜒′ ↔ [𝑗 / 𝑖]𝜒)

Assertion

Ref	Expression
bnj1040	⊢ (𝜒′ ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑′ ∧ 𝜓′))

Distinct variable groups:   𝐷,𝑖   𝑓,𝑖   𝑖,𝑛

Allowed substitution hints:   𝜑(𝑓, 𝑖, 𝑗, 𝑛)   𝜓(𝑓, 𝑖, 𝑗, 𝑛)   𝜒(𝑓, 𝑖, 𝑗, 𝑛)   𝐷(𝑓, 𝑗, 𝑛)   𝜑′(𝑓, 𝑖, 𝑗, 𝑛)   𝜓′(𝑓, 𝑖, 𝑗, 𝑛)   𝜒′(𝑓, 𝑖, 𝑗, 𝑛)

Proof of Theorem bnj1040

Step	Hyp	Ref	Expression
1		bnj1040.4	. 2 ⊢ (𝜒′ ↔ [𝑗 / 𝑖]𝜒)
2		bnj1040.3	. . 3 ⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
3	2	sbcbii 3798	. 2 ⊢ ([𝑗 / 𝑖]𝜒 ↔ [𝑗 / 𝑖](𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
4		df-bnj17 35184	. . 3 ⊢ (([𝑗 / 𝑖]𝑛 ∈ 𝐷 ∧ [𝑗 / 𝑖]𝑓 Fn 𝑛 ∧ [𝑗 / 𝑖]𝜑 ∧ [𝑗 / 𝑖]𝜓) ↔ (([𝑗 / 𝑖]𝑛 ∈ 𝐷 ∧ [𝑗 / 𝑖]𝑓 Fn 𝑛 ∧ [𝑗 / 𝑖]𝜑) ∧ [𝑗 / 𝑖]𝜓))
5		vex 3457	. . . . . 6 ⊢ 𝑗 ∈ V
6	5	bnj525 35235	. . . . 5 ⊢ ([𝑗 / 𝑖]𝑛 ∈ 𝐷 ↔ 𝑛 ∈ 𝐷)
7	6	bicomi 227	. . . 4 ⊢ (𝑛 ∈ 𝐷 ↔ [𝑗 / 𝑖]𝑛 ∈ 𝐷)
8	5	bnj525 35235	. . . . 5 ⊢ ([𝑗 / 𝑖]𝑓 Fn 𝑛 ↔ 𝑓 Fn 𝑛)
9	8	bicomi 227	. . . 4 ⊢ (𝑓 Fn 𝑛 ↔ [𝑗 / 𝑖]𝑓 Fn 𝑛)
10		bnj1040.1	. . . 4 ⊢ (𝜑′ ↔ [𝑗 / 𝑖]𝜑)
11		bnj1040.2	. . . 4 ⊢ (𝜓′ ↔ [𝑗 / 𝑖]𝜓)
12	7, 9, 10, 11	bnj887 35262	. . 3 ⊢ ((𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑′ ∧ 𝜓′) ↔ ([𝑗 / 𝑖]𝑛 ∈ 𝐷 ∧ [𝑗 / 𝑖]𝑓 Fn 𝑛 ∧ [𝑗 / 𝑖]𝜑 ∧ [𝑗 / 𝑖]𝜓))
13		df-bnj17 35184	. . . . 5 ⊢ ((𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ ((𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑) ∧ 𝜓))
14	13	sbcbii 3798	. . . 4 ⊢ ([𝑗 / 𝑖](𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ [𝑗 / 𝑖]((𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑) ∧ 𝜓))
15		sbcan 3791	. . . 4 ⊢ ([𝑗 / 𝑖]((𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑) ∧ 𝜓) ↔ ([𝑗 / 𝑖](𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑) ∧ [𝑗 / 𝑖]𝜓))
16		sbc3an 3806	. . . . 5 ⊢ ([𝑗 / 𝑖](𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑) ↔ ([𝑗 / 𝑖]𝑛 ∈ 𝐷 ∧ [𝑗 / 𝑖]𝑓 Fn 𝑛 ∧ [𝑗 / 𝑖]𝜑))
17	16	anbi1i 636	. . . 4 ⊢ (([𝑗 / 𝑖](𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑) ∧ [𝑗 / 𝑖]𝜓) ↔ (([𝑗 / 𝑖]𝑛 ∈ 𝐷 ∧ [𝑗 / 𝑖]𝑓 Fn 𝑛 ∧ [𝑗 / 𝑖]𝜑) ∧ [𝑗 / 𝑖]𝜓))
18	14, 15, 17	3bitri 300	. . 3 ⊢ ([𝑗 / 𝑖](𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ (([𝑗 / 𝑖]𝑛 ∈ 𝐷 ∧ [𝑗 / 𝑖]𝑓 Fn 𝑛 ∧ [𝑗 / 𝑖]𝜑) ∧ [𝑗 / 𝑖]𝜓))
19	4, 12, 18	3bitr4ri 307	. 2 ⊢ ([𝑗 / 𝑖](𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑′ ∧ 𝜓′))
20	1, 3, 19	3bitri 300	1 ⊢ (𝜒′ ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑′ ∧ 𝜓′))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   ∈ wcel 2145  [wsbc 3742   Fn wfn 6532   ∧ w-bnj17 35183

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-ext 2734

This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-v 3455  df-sbc 3743  df-bnj17 35184

This theorem is used by:  bnj1128  35486