Theorem bnj958 32212

Description: Technical lemma for bnj69 32282. 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
bnj958.1	⊢ 𝐶 = ∪ 𝑦 ∈ (𝑓‘𝑚) pred(𝑦, 𝐴, 𝑅)
bnj958.2	⊢ 𝐺 = (𝑓 ∪ {⟨𝑛, 𝐶⟩})

Assertion

Ref	Expression
bnj958	⊢ ((𝐺‘𝑖) = (𝑓‘𝑖) → ∀𝑦(𝐺‘𝑖) = (𝑓‘𝑖))

Distinct variable groups:   𝑦,𝑓   𝑦,𝑖   𝑦,𝑛

Allowed substitution hints:   𝐴(𝑦,𝑓,𝑖,𝑚,𝑛)   𝐶(𝑦,𝑓,𝑖,𝑚,𝑛)   𝑅(𝑦,𝑓,𝑖,𝑚,𝑛)   𝐺(𝑦,𝑓,𝑖,𝑚,𝑛)

Proof of Theorem bnj958

Step	Hyp	Ref	Expression
1		bnj958.2	. . . . 5 ⊢ 𝐺 = (𝑓 ∪ {⟨𝑛, 𝐶⟩})
2		nfcv 2977	. . . . . 6 ⊢ Ⅎ𝑦𝑓
3		nfcv 2977	. . . . . . . 8 ⊢ Ⅎ𝑦𝑛
4		bnj958.1	. . . . . . . . 9 ⊢ 𝐶 = ∪ 𝑦 ∈ (𝑓‘𝑚) pred(𝑦, 𝐴, 𝑅)
5		nfiu1 4953	. . . . . . . . 9 ⊢ Ⅎ𝑦∪ 𝑦 ∈ (𝑓‘𝑚) pred(𝑦, 𝐴, 𝑅)
6	4, 5	nfcxfr 2975	. . . . . . . 8 ⊢ Ⅎ𝑦𝐶
7	3, 6	nfop 4819	. . . . . . 7 ⊢ Ⅎ𝑦⟨𝑛, 𝐶⟩
8	7	nfsn 4643	. . . . . 6 ⊢ Ⅎ𝑦{⟨𝑛, 𝐶⟩}
9	2, 8	nfun 4141	. . . . 5 ⊢ Ⅎ𝑦(𝑓 ∪ {⟨𝑛, 𝐶⟩})
10	1, 9	nfcxfr 2975	. . . 4 ⊢ Ⅎ𝑦𝐺
11		nfcv 2977	. . . 4 ⊢ Ⅎ𝑦𝑖
12	10, 11	nffv 6680	. . 3 ⊢ Ⅎ𝑦(𝐺‘𝑖)
13	12	nfeq1 2993	. 2 ⊢ Ⅎ𝑦(𝐺‘𝑖) = (𝑓‘𝑖)
14	13	nf5ri 2195	1 ⊢ ((𝐺‘𝑖) = (𝑓‘𝑖) → ∀𝑦(𝐺‘𝑖) = (𝑓‘𝑖))

Syntax hints:   → wi 4  ∀wal 1535   = wceq 1537   ∪ cun 3934  {csn 4567  ⟨cop 4573  ∪ ciun 4919  ‘cfv 6355   predc-bnj14 31958

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 2793

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 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-iun 4921  df-br 5067  df-iota 6314  df-fv 6363

This theorem is referenced by:  bnj966  32216  bnj967  32217