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 35696
Description: Technical lemma for bnj1500 35698. 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 35451 . . . . . . 7 (𝑤 ∈ 𝐶 → ∀𝑓 𝑤 ∈ 𝐶)
43nfcii 2911 . . . . . 6 Ⅎ𝑓𝐶
54nfuni 4873 . . . . 5 Ⅎ𝑓∪ 𝐶
61, 5nfcxfr 2920 . . . 4 Ⅎ𝑓𝐹
7 nfcv 2922 . . . 4 Ⅎ𝑓𝑥
86, 7nffv 6895 . . 3 Ⅎ𝑓(𝐹‘𝑥)
9 nfcv 2922 . . . 4 Ⅎ𝑓𝐺
10 nfcv 2922 . . . . . 6 Ⅎ𝑓 pred(𝑥, 𝐴, 𝑅)
116, 10nfres 5971 . . . . 5 Ⅎ𝑓(𝐹 ↾ pred(𝑥, 𝐴, 𝑅))
127, 11nfop 4848 . . . 4 Ⅎ𝑓⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩
139, 12nffv 6895 . . 3 Ⅎ𝑓(𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩)
148, 13nfeq 2935 . 2 Ⅎ𝑓(𝐹‘𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩)
1514nf5ri 2231 1 ((𝐹‘𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩) → ∀𝑓(𝐹‘𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1567   = wceq 1569  {cab 2738  ∀wral 3076  ∃wrex 3086   ⊆ wss 3895  ⟨cop 4589  ∪ cuni 4866   ↾ cres 5652   Fn wfn 6533  ‘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
This theorem is used by:  bnj1501  35697
  Copyright terms: Public domain W3C validator