Theorem bnj1529 35634

Description: Technical lemma for bnj1522 35636. 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
bnj1529.1	⊢ (𝜒 → ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩))
bnj1529.2	⊢ (𝑤 ∈ 𝐹 → ∀𝑥 𝑤 ∈ 𝐹)

Assertion

Ref	Expression
bnj1529	⊢ (𝜒 → ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝐺‘⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩))

Distinct variable groups:   𝑤,𝐴,𝑥,𝑦   𝑤,𝐹,𝑦   𝑤,𝐺,𝑥,𝑦   𝑤,𝑅,𝑥,𝑦

Allowed substitution hints:   𝜒(𝑥, 𝑦, 𝑤)   𝐹(𝑥)

Proof of Theorem bnj1529

Step	Hyp	Ref	Expression
1		bnj1529.1	. 2 ⊢ (𝜒 → ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩))
2		nfv 1947	. . 3 ⊢ Ⅎ𝑦(𝐹‘𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩)
3		bnj1529.2	. . . . . 6 ⊢ (𝑤 ∈ 𝐹 → ∀𝑥 𝑤 ∈ 𝐹)
4	3	nfcii 2911	. . . . 5 ⊢ Ⅎ𝑥𝐹
5		nfcv 2922	. . . . 5 ⊢ Ⅎ𝑥𝑦
6	4, 5	nffv 6883	. . . 4 ⊢ Ⅎ𝑥(𝐹‘𝑦)
7		nfcv 2922	. . . . 5 ⊢ Ⅎ𝑥𝐺
8		nfcv 2922	. . . . . . 7 ⊢ Ⅎ𝑥 pred(𝑦, 𝐴, 𝑅)
9	4, 8	nfres 5968	. . . . . 6 ⊢ Ⅎ𝑥(𝐹 ↾ pred(𝑦, 𝐴, 𝑅))
10	5, 9	nfop 4848	. . . . 5 ⊢ Ⅎ𝑥⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩
11	7, 10	nffv 6883	. . . 4 ⊢ Ⅎ𝑥(𝐺‘⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩)
12	6, 11	nfeq 2935	. . 3 ⊢ Ⅎ𝑥(𝐹‘𝑦) = (𝐺‘⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩)
13		fveq2 6873	. . . 4 ⊢ (𝑥 = 𝑦 → (𝐹‘𝑥) = (𝐹‘𝑦))
14		id 23	. . . . . 6 ⊢ (𝑥 = 𝑦 → 𝑥 = 𝑦)
15		bnj602 35479	. . . . . . 7 ⊢ (𝑥 = 𝑦 → pred(𝑥, 𝐴, 𝑅) = pred(𝑦, 𝐴, 𝑅))
16	15	reseq2d 5966	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝐹 ↾ pred(𝑥, 𝐴, 𝑅)) = (𝐹 ↾ pred(𝑦, 𝐴, 𝑅)))
17	14, 16	opeq12d 4840	. . . . 5 ⊢ (𝑥 = 𝑦 → ⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩ = ⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩)
18	17	fveq2d 6877	. . . 4 ⊢ (𝑥 = 𝑦 → (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩) = (𝐺‘⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩))
19	13, 18	eqeq12d 2776	. . 3 ⊢ (𝑥 = 𝑦 → ((𝐹‘𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩) ↔ (𝐹‘𝑦) = (𝐺‘⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩)))
20	2, 12, 19	cbvralw 3304	. 2 ⊢ (∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩) ↔ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝐺‘⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩))
21	1, 20	sylib 221	1 ⊢ (𝜒 → ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝐺‘⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩))

This proof depends on syntax axioms:   → wi 4  ∀wal 1568   = wceq 1570   ∈ wcel 2145  ∀wral 3076  ⟨cop 4589   ↾ cres 5649  ‘cfv 6527   predc-bnj14 35253

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 2213  ax-ext 2732

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-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-xp 5653  df-res 5659  df-iota 6483  df-fv 6535  df-bnj14 35254

This theorem is used by:  bnj1523  35635