Theorem bnj591 32185

Description: Technical lemma for bnj852 32195. 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 3831	. 2 ⊢ ([𝑘 / 𝑗]𝜃 ↔ [𝑘 / 𝑗]((𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝜒′) → (𝑓‘𝑗) = (𝑔‘𝑗)))
3		vex 3499	. . 3 ⊢ 𝑘 ∈ V
4		fveq2 6672	. . . . 5 ⊢ (𝑗 = 𝑘 → (𝑓‘𝑗) = (𝑓‘𝑘))
5		fveq2 6672	. . . . 5 ⊢ (𝑗 = 𝑘 → (𝑔‘𝑗) = (𝑔‘𝑘))
6	4, 5	eqeq12d 2839	. . . 4 ⊢ (𝑗 = 𝑘 → ((𝑓‘𝑗) = (𝑔‘𝑗) ↔ (𝑓‘𝑘) = (𝑔‘𝑘)))
7	6	imbi2d 343	. . 3 ⊢ (𝑗 = 𝑘 → (((𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝜒′) → (𝑓‘𝑗) = (𝑔‘𝑗)) ↔ ((𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝜒′) → (𝑓‘𝑘) = (𝑔‘𝑘))))
8	3, 7	sbcie 3814	. 2 ⊢ ([𝑘 / 𝑗]((𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝜒′) → (𝑓‘𝑗) = (𝑔‘𝑗)) ↔ ((𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝜒′) → (𝑓‘𝑘) = (𝑔‘𝑘)))
9	2, 8	bitri 277	1 ⊢ ([𝑘 / 𝑗]𝜃 ↔ ((𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝜒′) → (𝑓‘𝑘) = (𝑔‘𝑘)))

Syntax hints:   → wi 4   ↔ wb 208   ∧ w3a 1083   = wceq 1537   ∈ wcel 2114  [wsbc 3774  ‘cfv 6357

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-rab 3149  df-v 3498  df-sbc 3775  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-br 5069  df-iota 6316  df-fv 6365

This theorem is referenced by:  bnj580  32187