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 32583
 Description: Technical lemma for bnj1522 32585. 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 1915 . . 3 𝑦(𝐹𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩)
3 bnj1529.2 . . . . . 6 (𝑤𝐹 → ∀𝑥 𝑤𝐹)
43nfcii 2903 . . . . 5 𝑥𝐹
5 nfcv 2919 . . . . 5 𝑥𝑦
64, 5nffv 6673 . . . 4 𝑥(𝐹𝑦)
7 nfcv 2919 . . . . 5 𝑥𝐺
8 nfcv 2919 . . . . . . 7 𝑥 pred(𝑦, 𝐴, 𝑅)
94, 8nfres 5830 . . . . . 6 𝑥(𝐹 ↾ pred(𝑦, 𝐴, 𝑅))
105, 9nfop 4782 . . . . 5 𝑥𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩
117, 10nffv 6673 . . . 4 𝑥(𝐺‘⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩)
126, 11nfeq 2932 . . 3 𝑥(𝐹𝑦) = (𝐺‘⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩)
13 fveq2 6663 . . . 4 (𝑥 = 𝑦 → (𝐹𝑥) = (𝐹𝑦))
14 id 22 . . . . . 6 (𝑥 = 𝑦𝑥 = 𝑦)
15 bnj602 32428 . . . . . . 7 (𝑥 = 𝑦 → pred(𝑥, 𝐴, 𝑅) = pred(𝑦, 𝐴, 𝑅))
1615reseq2d 5828 . . . . . 6 (𝑥 = 𝑦 → (𝐹 ↾ pred(𝑥, 𝐴, 𝑅)) = (𝐹 ↾ pred(𝑦, 𝐴, 𝑅)))
1714, 16opeq12d 4774 . . . . 5 (𝑥 = 𝑦 → ⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩ = ⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩)
1817fveq2d 6667 . . . 4 (𝑥 = 𝑦 → (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩) = (𝐺‘⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩))
1913, 18eqeq12d 2774 . . 3 (𝑥 = 𝑦 → ((𝐹𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩) ↔ (𝐹𝑦) = (𝐺‘⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩)))
202, 12, 19cbvralw 3352 . 2 (∀𝑥𝐴 (𝐹𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩) ↔ ∀𝑦𝐴 (𝐹𝑦) = (𝐺‘⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩))
211, 20sylib 221 1 (𝜒 → ∀𝑦𝐴 (𝐹𝑦) = (𝐺‘⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩))
 Colors of variables: wff setvar class Syntax hints:   → wi 4  ∀wal 1536   = wceq 1538   ∈ wcel 2111  ∀wral 3070  ⟨cop 4531   ↾ cres 5530  ‘cfv 6340   predc-bnj14 32199 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2729 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2736  df-cleq 2750  df-clel 2830  df-nfc 2901  df-ral 3075  df-rex 3076  df-rab 3079  df-v 3411  df-dif 3863  df-un 3865  df-in 3867  df-ss 3877  df-nul 4228  df-if 4424  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4802  df-br 5037  df-opab 5099  df-xp 5534  df-res 5540  df-iota 6299  df-fv 6348  df-bnj14 32200 This theorem is referenced by:  bnj1523  32584
 Copyright terms: Public domain W3C validator