Theorem bnj591 34903

Description: Technical lemma for bnj852 34913. 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.)

Hypothesis

Ref	Expression
bnj591.1	⊢ (𝜃 ↔ ((𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝜒′) → (𝑓‘𝑗) = (𝑔‘𝑗)))

Assertion

Ref	Expression
bnj591	⊢ ([𝑘 / 𝑗]𝜃 ↔ ((𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝜒′) → (𝑓‘𝑘) = (𝑔‘𝑘)))

Distinct variable groups:   𝐷,𝑗   𝜒,𝑗   𝑗,𝜒′   𝑓,𝑗   𝑔,𝑗   𝑗,𝑘   𝑗,𝑛

Allowed substitution hints:   𝜒(𝑓,𝑔,𝑘,𝑛)   𝜃(𝑓,𝑔,𝑗,𝑘,𝑛)   𝐷(𝑓,𝑔,𝑘,𝑛)   𝜒′(𝑓,𝑔,𝑘,𝑛)

Proof of Theorem bnj591

Step	Hyp	Ref	Expression
1		bnj591.1	. . 3 ⊢ (𝜃 ↔ ((𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝜒′) → (𝑓‘𝑗) = (𝑔‘𝑗)))
2	1	sbcbii 3851	. 2 ⊢ ([𝑘 / 𝑗]𝜃 ↔ [𝑘 / 𝑗]((𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝜒′) → (𝑓‘𝑗) = (𝑔‘𝑗)))
3		vex 3481	. . 3 ⊢ 𝑘 ∈ V
4		fveq2 6906	. . . . 5 ⊢ (𝑗 = 𝑘 → (𝑓‘𝑗) = (𝑓‘𝑘))
5		fveq2 6906	. . . . 5 ⊢ (𝑗 = 𝑘 → (𝑔‘𝑗) = (𝑔‘𝑘))
6	4, 5	eqeq12d 2750	. . . 4 ⊢ (𝑗 = 𝑘 → ((𝑓‘𝑗) = (𝑔‘𝑗) ↔ (𝑓‘𝑘) = (𝑔‘𝑘)))
7	6	imbi2d 340	. . 3 ⊢ (𝑗 = 𝑘 → (((𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝜒′) → (𝑓‘𝑗) = (𝑔‘𝑗)) ↔ ((𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝜒′) → (𝑓‘𝑘) = (𝑔‘𝑘))))
8	3, 7	sbcie 3834	. 2 ⊢ ([𝑘 / 𝑗]((𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝜒′) → (𝑓‘𝑗) = (𝑔‘𝑗)) ↔ ((𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝜒′) → (𝑓‘𝑘) = (𝑔‘𝑘)))
9	2, 8	bitri 275	1 ⊢ ([𝑘 / 𝑗]𝜃 ↔ ((𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝜒′) → (𝑓‘𝑘) = (𝑔‘𝑘)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ w3a 1086   = wceq 1536   ∈ wcel 2105  [wsbc 3790  ‘cfv 6562

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1791  ax-4 1805  ax-5 1907  ax-6 1964  ax-7 2004  ax-8 2107  ax-9 2115  ax-ext 2705

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1539  df-fal 1549  df-ex 1776  df-sb 2062  df-clab 2712  df-cleq 2726  df-clel 2813  df-rab 3433  df-v 3479  df-sbc 3791  df-dif 3965  df-un 3967  df-ss 3979  df-nul 4339  df-if 4531  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4912  df-br 5148  df-iota 6515  df-fv 6570

This theorem is referenced by:  bnj580  34905