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

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

Proof of Theorem bnj1519
StepHypRef Expression
1 bnj1519.4 . . . . 5 𝐹 = 𝐶
2 bnj1519.3 . . . . . . 7 𝐶 = {𝑓 ∣ ∃𝑑𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌))}
3 nfre1 3289 . . . . . . . 8 𝑑𝑑𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌))
43nfab 2930 . . . . . . 7 𝑑{𝑓 ∣ ∃𝑑𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌))}
52, 4nfcxfr 2922 . . . . . 6 𝑑𝐶
65nfuni 4877 . . . . 5 𝑑 𝐶
71, 6nfcxfr 2922 . . . 4 𝑑𝐹
8 nfcv 2924 . . . 4 𝑑𝑥
97, 8nffv 6892 . . 3 𝑑(𝐹𝑥)
10 nfcv 2924 . . . 4 𝑑𝐺
11 nfcv 2924 . . . . . 6 𝑑 pred(𝑥, 𝐴, 𝑅)
127, 11nfres 5978 . . . . 5 𝑑(𝐹 ↾ pred(𝑥, 𝐴, 𝑅))
138, 12nfop 4852 . . . 4 𝑑𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩
1410, 13nffv 6892 . . 3 𝑑(𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩)
159, 14nfeq 2937 . 2 𝑑(𝐹𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩)
1615nf5ri 2233 1 ((𝐹𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩) → ∀𝑑(𝐹𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401  wal 1568   = wceq 1570  {cab 2740  wral 3078  wrex 3088  wss 3902  cop 4593   cuni 4870  cres 5661   Fn wfn 6532  cfv 6537   predc-bnj14 35185
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 2215  ax-ext 2734
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 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-xp 5665  df-res 5671  df-iota 6493  df-fv 6545
This theorem is used by:  bnj1501  35563
  Copyright terms: Public domain W3C validator