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 35700
Description: Technical lemma for bnj1522 35702. 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 1946 . . 3 Ⅎ𝑦(𝐹‘𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩)
3 bnj1529.2 . . . . . 6 (𝑤 ∈ 𝐹 → ∀𝑥 𝑤 ∈ 𝐹)
43nfcii 2911 . . . . 5 Ⅎ𝑥𝐹
5 nfcv 2922 . . . . 5 Ⅎ𝑥𝑦
64, 5nffv 6895 . . . 4 Ⅎ𝑥(𝐹‘𝑦)
7 nfcv 2922 . . . . 5 Ⅎ𝑥𝐺
8 nfcv 2922 . . . . . . 7 Ⅎ𝑥 pred(𝑦, 𝐴, 𝑅)
94, 8nfres 5971 . . . . . 6 Ⅎ𝑥(𝐹 ↾ pred(𝑦, 𝐴, 𝑅))
105, 9nfop 4848 . . . . 5 Ⅎ𝑥⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩
117, 10nffv 6895 . . . 4 Ⅎ𝑥(𝐺‘⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩)
126, 11nfeq 2935 . . 3 Ⅎ𝑥(𝐹‘𝑦) = (𝐺‘⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩)
13 fveq2 6885 . . . 4 (𝑥 = 𝑦 → (𝐹‘𝑥) = (𝐹‘𝑦))
14 id 23 . . . . . 6 (𝑥 = 𝑦 → 𝑥 = 𝑦)
15 bnj602 35545 . . . . . . 7 (𝑥 = 𝑦 → pred(𝑥, 𝐴, 𝑅) = pred(𝑦, 𝐴, 𝑅))
1615reseq2d 5969 . . . . . 6 (𝑥 = 𝑦 → (𝐹 ↾ pred(𝑥, 𝐴, 𝑅)) = (𝐹 ↾ pred(𝑦, 𝐴, 𝑅)))
1714, 16opeq12d 4840 . . . . 5 (𝑥 = 𝑦 → ⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩ = ⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩)
1817fveq2d 6889 . . . 4 (𝑥 = 𝑦 → (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩) = (𝐺‘⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩))
1913, 18eqeq12d 2776 . . 3 (𝑥 = 𝑦 → ((𝐹‘𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩) ↔ (𝐹‘𝑦) = (𝐺‘⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩)))
202, 12, 19cbvralw 3304 . 2 (∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩) ↔ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝐺‘⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩))
211, 20sylib 221 1 (𝜒 → ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝐺‘⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4  ∀wal 1567   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ⟨cop 4589   ↾ cres 5652  ‘cfv 6538   predc-bnj14 35319
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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-ss 3896  df-dif 4047  df-in 4091  df-un 4151  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 5656  df-res 5662  df-iota 6494  df-fv 6546  df-bnj14 35320
This theorem is used by:  bnj1523  35701
  Copyright terms: Public domain W3C validator