Users' Mathboxes Mathbox for Jonathan Ben-Naim < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bnj1529 Structured version   Visualization version   GIF version

Theorem bnj1529 35812
Description: Technical lemma for bnj1522 35814. 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
StepHypRef Expression
1 bnj1529.1 . 2 (𝜒 → ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩))
2 nfv 1951 . . 3 Ⅎ𝑦(𝐹‘𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩)
3 bnj1529.2 . . . . . 6 (𝑤 ∈ 𝐹 → ∀𝑥 𝑤 ∈ 𝐹)
43nfcii 2918 . . . . 5 Ⅎ𝑥𝐹
5 nfcv 2929 . . . . 5 Ⅎ𝑥𝑦
64, 5nffv 6925 . . . 4 Ⅎ𝑥(𝐹‘𝑦)
7 nfcv 2929 . . . . 5 Ⅎ𝑥𝐺
8 nfcv 2929 . . . . . . 7 Ⅎ𝑥 pred(𝑦, 𝐴, 𝑅)
94, 8nfres 5987 . . . . . 6 Ⅎ𝑥(𝐹 ↾ pred(𝑦, 𝐴, 𝑅))
105, 9nfop 4853 . . . . 5 Ⅎ𝑥⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩
117, 10nffv 6925 . . . 4 Ⅎ𝑥(𝐺‘⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩)
126, 11nfeq 2942 . . 3 Ⅎ𝑥(𝐹‘𝑦) = (𝐺‘⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩)
13 fveq2 6915 . . . 4 (𝑥 = 𝑦 → (𝐹‘𝑥) = (𝐹‘𝑦))
14 id 23 . . . . . 6 (𝑥 = 𝑦 → 𝑥 = 𝑦)
15 bnj602 35657 . . . . . . 7 (𝑥 = 𝑦 → pred(𝑥, 𝐴, 𝑅) = pred(𝑦, 𝐴, 𝑅))
1615reseq2d 5985 . . . . . 6 (𝑥 = 𝑦 → (𝐹 ↾ pred(𝑥, 𝐴, 𝑅)) = (𝐹 ↾ pred(𝑦, 𝐴, 𝑅)))
1714, 16opeq12d 4852 . . . . 5 (𝑥 = 𝑦 → ⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩ = ⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩)
1817fveq2d 6919 . . . 4 (𝑥 = 𝑦 → (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩) = (𝐺‘⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩))
1913, 18eqeq12d 2782 . . 3 (𝑥 = 𝑦 → ((𝐹‘𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩) ↔ (𝐹‘𝑦) = (𝐺‘⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩)))
202, 12, 19cbvralw 3308 . 2 (∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩) ↔ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝐺‘⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩))
211, 20sylib 221 1 (𝜒 → ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝐺‘⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4  ∀wal 1570   = wceq 1572   ∈ wcel 2150  ∀wral 3083  ⟨cop 4839   ↾ cres 5659  ‘cfv 6565   predc-bnj14 35431
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ral 3084  df-rex 3094  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-br 5108  df-opab 5173  df-xp 5663  df-res 5669  df-iota 6519  df-fv 6573  df-bnj14 35432
This theorem is used by:  bnj1523  35813
  Copyright terms: Public domain W3C validator