Theorem bnj945 35270

Description: Technical lemma for bnj69 35506. 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.)

Hypothesis

Ref	Expression
bnj945.1	⊢ 𝐺 = (𝑓 ∪ {⟨𝑛, 𝐶⟩})

Assertion

Ref	Expression
bnj945	⊢ ((𝐶 ∈ V ∧ 𝑓 Fn 𝑛 ∧ 𝑝 = suc 𝑛 ∧ 𝐴 ∈ 𝑛) → (𝐺‘𝐴) = (𝑓‘𝐴))

Proof of Theorem bnj945

Step	Hyp	Ref	Expression
1		fndm 6639	. . . . . . 7 ⊢ (𝑓 Fn 𝑛 → dom 𝑓 = 𝑛)
2	1	ad2antll 742	. . . . . 6 ⊢ ((𝐶 ∈ V ∧ (𝑝 = suc 𝑛 ∧ 𝑓 Fn 𝑛)) → dom 𝑓 = 𝑛)
3	2	eleq2d 2848	. . . . 5 ⊢ ((𝐶 ∈ V ∧ (𝑝 = suc 𝑛 ∧ 𝑓 Fn 𝑛)) → (𝐴 ∈ dom 𝑓 ↔ 𝐴 ∈ 𝑛))
4	3	pm5.32i 585	. . . 4 ⊢ (((𝐶 ∈ V ∧ (𝑝 = suc 𝑛 ∧ 𝑓 Fn 𝑛)) ∧ 𝐴 ∈ dom 𝑓) ↔ ((𝐶 ∈ V ∧ (𝑝 = suc 𝑛 ∧ 𝑓 Fn 𝑛)) ∧ 𝐴 ∈ 𝑛))
5		bnj945.1	. . . . . . . . 9 ⊢ 𝐺 = (𝑓 ∪ {⟨𝑛, 𝐶⟩})
6	5	bnj941 35269	. . . . . . . 8 ⊢ (𝐶 ∈ V → ((𝑝 = suc 𝑛 ∧ 𝑓 Fn 𝑛) → 𝐺 Fn 𝑝))
7	6	imp 412	. . . . . . 7 ⊢ ((𝐶 ∈ V ∧ (𝑝 = suc 𝑛 ∧ 𝑓 Fn 𝑛)) → 𝐺 Fn 𝑝)
8	7	fnfund 6637	. . . . . 6 ⊢ ((𝐶 ∈ V ∧ (𝑝 = suc 𝑛 ∧ 𝑓 Fn 𝑛)) → Fun 𝐺)
9	5	bnj931 35267	. . . . . 6 ⊢ 𝑓 ⊆ 𝐺
10	8, 9	jctir 530	. . . . 5 ⊢ ((𝐶 ∈ V ∧ (𝑝 = suc 𝑛 ∧ 𝑓 Fn 𝑛)) → (Fun 𝐺 ∧ 𝑓 ⊆ 𝐺))
11	10	anim1i 627	. . . 4 ⊢ (((𝐶 ∈ V ∧ (𝑝 = suc 𝑛 ∧ 𝑓 Fn 𝑛)) ∧ 𝐴 ∈ dom 𝑓) → ((Fun 𝐺 ∧ 𝑓 ⊆ 𝐺) ∧ 𝐴 ∈ dom 𝑓))
12	4, 11	sylbir 238	. . 3 ⊢ (((𝐶 ∈ V ∧ (𝑝 = suc 𝑛 ∧ 𝑓 Fn 𝑛)) ∧ 𝐴 ∈ 𝑛) → ((Fun 𝐺 ∧ 𝑓 ⊆ 𝐺) ∧ 𝐴 ∈ dom 𝑓))
13		df-bnj17 35184	. . . 4 ⊢ ((𝐶 ∈ V ∧ 𝑓 Fn 𝑛 ∧ 𝑝 = suc 𝑛 ∧ 𝐴 ∈ 𝑛) ↔ ((𝐶 ∈ V ∧ 𝑓 Fn 𝑛 ∧ 𝑝 = suc 𝑛) ∧ 𝐴 ∈ 𝑛))
14		3ancomb 1116	. . . . . 6 ⊢ ((𝐶 ∈ V ∧ 𝑓 Fn 𝑛 ∧ 𝑝 = suc 𝑛) ↔ (𝐶 ∈ V ∧ 𝑝 = suc 𝑛 ∧ 𝑓 Fn 𝑛))
15		3anass 1111	. . . . . 6 ⊢ ((𝐶 ∈ V ∧ 𝑝 = suc 𝑛 ∧ 𝑓 Fn 𝑛) ↔ (𝐶 ∈ V ∧ (𝑝 = suc 𝑛 ∧ 𝑓 Fn 𝑛)))
16	14, 15	bitri 278	. . . . 5 ⊢ ((𝐶 ∈ V ∧ 𝑓 Fn 𝑛 ∧ 𝑝 = suc 𝑛) ↔ (𝐶 ∈ V ∧ (𝑝 = suc 𝑛 ∧ 𝑓 Fn 𝑛)))
17	16	anbi1i 636	. . . 4 ⊢ (((𝐶 ∈ V ∧ 𝑓 Fn 𝑛 ∧ 𝑝 = suc 𝑛) ∧ 𝐴 ∈ 𝑛) ↔ ((𝐶 ∈ V ∧ (𝑝 = suc 𝑛 ∧ 𝑓 Fn 𝑛)) ∧ 𝐴 ∈ 𝑛))
18	13, 17	bitri 278	. . 3 ⊢ ((𝐶 ∈ V ∧ 𝑓 Fn 𝑛 ∧ 𝑝 = suc 𝑛 ∧ 𝐴 ∈ 𝑛) ↔ ((𝐶 ∈ V ∧ (𝑝 = suc 𝑛 ∧ 𝑓 Fn 𝑛)) ∧ 𝐴 ∈ 𝑛))
19		df-3an 1105	. . 3 ⊢ ((Fun 𝐺 ∧ 𝑓 ⊆ 𝐺 ∧ 𝐴 ∈ dom 𝑓) ↔ ((Fun 𝐺 ∧ 𝑓 ⊆ 𝐺) ∧ 𝐴 ∈ dom 𝑓))
20	12, 18, 19	3imtr4i 295	. 2 ⊢ ((𝐶 ∈ V ∧ 𝑓 Fn 𝑛 ∧ 𝑝 = suc 𝑛 ∧ 𝐴 ∈ 𝑛) → (Fun 𝐺 ∧ 𝑓 ⊆ 𝐺 ∧ 𝐴 ∈ dom 𝑓))
21		funssfv 6903	. 2 ⊢ ((Fun 𝐺 ∧ 𝑓 ⊆ 𝐺 ∧ 𝐴 ∈ dom 𝑓) → (𝐺‘𝐴) = (𝑓‘𝐴))
22	20, 21	syl 18	1 ⊢ ((𝐶 ∈ V ∧ 𝑓 Fn 𝑛 ∧ 𝑝 = suc 𝑛 ∧ 𝐴 ∈ 𝑛) → (𝐺‘𝐴) = (𝑓‘𝐴))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  Vcvv 3453   ∪ cun 3900   ⊆ wss 3902  {csn 4587  ⟨cop 4593  dom cdm 5659  suc csuc 6363  Fun wfun 6531   Fn wfn 6532  ‘cfv 6537   ∧ w-bnj17 35183

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-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402  ax-reg 9567

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-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  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-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-res 5671  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-fv 6545  df-bnj17 35184

This theorem is used by:  bnj966  35440  bnj967  35441  bnj1006  35456