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

Theorem bnj1520 35463
Description: Technical lemma for bnj1500 35465. 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
bnj1520.1 𝐵 = {𝑑 ∣ (𝑑𝐴 ∧ ∀𝑥𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
bnj1520.2 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
bnj1520.3 𝐶 = {𝑓 ∣ ∃𝑑𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌))}
bnj1520.4 𝐹 = 𝐶
Assertion
Ref Expression
bnj1520 ((𝐹𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩) → ∀𝑓(𝐹𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩))
Distinct variable groups:   𝐴,𝑓   𝑓,𝐺   𝑅,𝑓   𝑥,𝑓
Allowed substitution hints:   𝐴(𝑥, 𝑑)   𝐵(𝑥, 𝑓, 𝑑)   𝐶(𝑥, 𝑓, 𝑑)   𝑅(𝑥, 𝑑)   𝐹(𝑥, 𝑓, 𝑑)   𝐺(𝑥, 𝑑)   𝑌(𝑥, 𝑓, 𝑑)

Proof of Theorem bnj1520
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 bnj1520.4 . . . . 5 𝐹 = 𝐶
2 bnj1520.3 . . . . . . . 8 𝐶 = {𝑓 ∣ ∃𝑑𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌))}
32bnj1317 35218 . . . . . . 7 (𝑤𝐶 → ∀𝑓 𝑤𝐶)
43nfcii 2913 . . . . . 6 𝑓𝐶
54nfuni 4878 . . . . 5 𝑓 𝐶
61, 5nfcxfr 2922 . . . 4 𝑓𝐹
7 nfcv 2924 . . . 4 𝑓𝑥
86, 7nffv 6891 . . 3 𝑓(𝐹𝑥)
9 nfcv 2924 . . . 4 𝑓𝐺
10 nfcv 2924 . . . . . 6 𝑓 pred(𝑥, 𝐴, 𝑅)
116, 10nfres 5979 . . . . 5 𝑓(𝐹 ↾ pred(𝑥, 𝐴, 𝑅))
127, 11nfop 4853 . . . 4 𝑓𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩
139, 12nffv 6891 . . 3 𝑓(𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩)
148, 13nfeq 2937 . 2 𝑓(𝐹𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩)
1514nf5ri 2230 1 ((𝐹𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩) → ∀𝑓(𝐹𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 400  wal 1567   = wceq 1569  {cab 2740  wral 3078  wrex 3088  wss 3904  cop 4594   cuni 4871  cres 5662   Fn wfn 6531  cfv 6536   predc-bnj14 35086
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-opab 5173  df-xp 5666  df-res 5672  df-iota 6492  df-fv 6544
This theorem is used by:  bnj1501  35464
  Copyright terms: Public domain W3C validator