Theorem bnj1519 32339

Description: Technical lemma for bnj1500 32342. 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

Step	Hyp	Ref	Expression
1		bnj1519.4	. . . . 5 ⊢ 𝐹 = ∪ 𝐶
2		bnj1519.3	. . . . . . 7 ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
3		nfre1 3308	. . . . . . . 8 ⊢ Ⅎ𝑑∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))
4	3	nfab 2986	. . . . . . 7 ⊢ Ⅎ𝑑{𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
5	2, 4	nfcxfr 2977	. . . . . 6 ⊢ Ⅎ𝑑𝐶
6	5	nfuni 4847	. . . . 5 ⊢ Ⅎ𝑑∪ 𝐶
7	1, 6	nfcxfr 2977	. . . 4 ⊢ Ⅎ𝑑𝐹
8		nfcv 2979	. . . 4 ⊢ Ⅎ𝑑𝑥
9	7, 8	nffv 6682	. . 3 ⊢ Ⅎ𝑑(𝐹‘𝑥)
10		nfcv 2979	. . . 4 ⊢ Ⅎ𝑑𝐺
11		nfcv 2979	. . . . . 6 ⊢ Ⅎ𝑑 pred(𝑥, 𝐴, 𝑅)
12	7, 11	nfres 5857	. . . . 5 ⊢ Ⅎ𝑑(𝐹 ↾ pred(𝑥, 𝐴, 𝑅))
13	8, 12	nfop 4821	. . . 4 ⊢ Ⅎ𝑑⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩
14	10, 13	nffv 6682	. . 3 ⊢ Ⅎ𝑑(𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩)
15	9, 14	nfeq 2993	. 2 ⊢ Ⅎ𝑑(𝐹‘𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩)
16	15	nf5ri 2195	1 ⊢ ((𝐹‘𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩) → ∀𝑑(𝐹‘𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩))

Syntax hints:   → wi 4   ∧ wa 398  ∀wal 1535   = wceq 1537  {cab 2801  ∀wral 3140  ∃wrex 3141   ⊆ wss 3938  ⟨cop 4575  ∪ cuni 4840   ↾ cres 5559   Fn wfn 6352  ‘cfv 6357   predc-bnj14 31960

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ral 3145  df-rex 3146  df-rab 3149  df-v 3498  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-br 5069  df-opab 5131  df-xp 5563  df-res 5569  df-iota 6316  df-fv 6365

This theorem is referenced by:  bnj1501  32341