Theorem tz7.44-3 7504

Description: The value of 𝐹 at a limit ordinal. Part 3 of Theorem 7.44 of [TakeutiZaring] p. 49. (Contributed by NM, 23-Apr-1995.) (Revised by David Abernethy, 19-Jun-2012.)

Hypotheses

Ref	Expression
tz7.44.1	⊢ 𝐺 = (𝑥 ∈ V ↦ if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ∪ ran 𝑥, (𝐻‘(𝑥‘∪ dom 𝑥)))))
tz7.44.2	⊢ (𝑦 ∈ 𝑋 → (𝐹‘𝑦) = (𝐺‘(𝐹 ↾ 𝑦)))
tz7.44.3	⊢ (𝑦 ∈ 𝑋 → (𝐹 ↾ 𝑦) ∈ V)
tz7.44.4	⊢ 𝐹 Fn 𝑋
tz7.44.5	⊢ Ord 𝑋

Assertion

Ref	Expression
tz7.44-3	⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → (𝐹‘𝐵) = ∪ (𝐹 “ 𝐵))

Distinct variable groups:   𝑥,𝐴   𝑥,𝑦,𝐵   𝑥,𝐹,𝑦   𝑦,𝐺   𝑥,𝐻   𝑦,𝑋

Allowed substitution hints:   𝐴(𝑦)   𝐺(𝑥)   𝐻(𝑦)   𝑋(𝑥)

Proof of Theorem tz7.44-3

Step	Hyp	Ref	Expression
1		fveq2 6191	. . . . . 6 ⊢ (𝑦 = 𝐵 → (𝐹‘𝑦) = (𝐹‘𝐵))
2		reseq2 5391	. . . . . . 7 ⊢ (𝑦 = 𝐵 → (𝐹 ↾ 𝑦) = (𝐹 ↾ 𝐵))
3	2	fveq2d 6195	. . . . . 6 ⊢ (𝑦 = 𝐵 → (𝐺‘(𝐹 ↾ 𝑦)) = (𝐺‘(𝐹 ↾ 𝐵)))
4	1, 3	eqeq12d 2637	. . . . 5 ⊢ (𝑦 = 𝐵 → ((𝐹‘𝑦) = (𝐺‘(𝐹 ↾ 𝑦)) ↔ (𝐹‘𝐵) = (𝐺‘(𝐹 ↾ 𝐵))))
5		tz7.44.2	. . . . 5 ⊢ (𝑦 ∈ 𝑋 → (𝐹‘𝑦) = (𝐺‘(𝐹 ↾ 𝑦)))
6	4, 5	vtoclga 3272	. . . 4 ⊢ (𝐵 ∈ 𝑋 → (𝐹‘𝐵) = (𝐺‘(𝐹 ↾ 𝐵)))
7	6	adantr 481	. . 3 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → (𝐹‘𝐵) = (𝐺‘(𝐹 ↾ 𝐵)))
8	2	eleq1d 2686	. . . . . . 7 ⊢ (𝑦 = 𝐵 → ((𝐹 ↾ 𝑦) ∈ V ↔ (𝐹 ↾ 𝐵) ∈ V))
9		tz7.44.3	. . . . . . 7 ⊢ (𝑦 ∈ 𝑋 → (𝐹 ↾ 𝑦) ∈ V)
10	8, 9	vtoclga 3272	. . . . . 6 ⊢ (𝐵 ∈ 𝑋 → (𝐹 ↾ 𝐵) ∈ V)
11	10	adantr 481	. . . . 5 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → (𝐹 ↾ 𝐵) ∈ V)
12		simpr 477	. . . . . . . . 9 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → Lim 𝐵)
13		nlim0 5783	. . . . . . . . . . 11 ⊢ ¬ Lim ∅
14		dmres 5419	. . . . . . . . . . . . . 14 ⊢ dom (𝐹 ↾ 𝐵) = (𝐵 ∩ dom 𝐹)
15		tz7.44.5	. . . . . . . . . . . . . . . . . 18 ⊢ Ord 𝑋
16		ordelss 5739	. . . . . . . . . . . . . . . . . 18 ⊢ ((Ord 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐵 ⊆ 𝑋)
17	15, 16	mpan 706	. . . . . . . . . . . . . . . . 17 ⊢ (𝐵 ∈ 𝑋 → 𝐵 ⊆ 𝑋)
18	17	adantr 481	. . . . . . . . . . . . . . . 16 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → 𝐵 ⊆ 𝑋)
19		tz7.44.4	. . . . . . . . . . . . . . . . 17 ⊢ 𝐹 Fn 𝑋
20		fndm 5990	. . . . . . . . . . . . . . . . 17 ⊢ (𝐹 Fn 𝑋 → dom 𝐹 = 𝑋)
21	19, 20	ax-mp 5	. . . . . . . . . . . . . . . 16 ⊢ dom 𝐹 = 𝑋
22	18, 21	syl6sseqr 3652	. . . . . . . . . . . . . . 15 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → 𝐵 ⊆ dom 𝐹)
23		df-ss 3588	. . . . . . . . . . . . . . 15 ⊢ (𝐵 ⊆ dom 𝐹 ↔ (𝐵 ∩ dom 𝐹) = 𝐵)
24	22, 23	sylib 208	. . . . . . . . . . . . . 14 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → (𝐵 ∩ dom 𝐹) = 𝐵)
25	14, 24	syl5eq 2668	. . . . . . . . . . . . 13 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → dom (𝐹 ↾ 𝐵) = 𝐵)
26		dmeq 5324	. . . . . . . . . . . . . 14 ⊢ ((𝐹 ↾ 𝐵) = ∅ → dom (𝐹 ↾ 𝐵) = dom ∅)
27		dm0 5339	. . . . . . . . . . . . . 14 ⊢ dom ∅ = ∅
28	26, 27	syl6eq 2672	. . . . . . . . . . . . 13 ⊢ ((𝐹 ↾ 𝐵) = ∅ → dom (𝐹 ↾ 𝐵) = ∅)
29	25, 28	sylan9req 2677	. . . . . . . . . . . 12 ⊢ (((𝐵 ∈ 𝑋 ∧ Lim 𝐵) ∧ (𝐹 ↾ 𝐵) = ∅) → 𝐵 = ∅)
30		limeq 5735	. . . . . . . . . . . 12 ⊢ (𝐵 = ∅ → (Lim 𝐵 ↔ Lim ∅))
31	29, 30	syl 17	. . . . . . . . . . 11 ⊢ (((𝐵 ∈ 𝑋 ∧ Lim 𝐵) ∧ (𝐹 ↾ 𝐵) = ∅) → (Lim 𝐵 ↔ Lim ∅))
32	13, 31	mtbiri 317	. . . . . . . . . 10 ⊢ (((𝐵 ∈ 𝑋 ∧ Lim 𝐵) ∧ (𝐹 ↾ 𝐵) = ∅) → ¬ Lim 𝐵)
33	32	ex 450	. . . . . . . . 9 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → ((𝐹 ↾ 𝐵) = ∅ → ¬ Lim 𝐵))
34	12, 33	mt2d 131	. . . . . . . 8 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → ¬ (𝐹 ↾ 𝐵) = ∅)
35	34	iffalsed 4097	. . . . . . 7 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → if((𝐹 ↾ 𝐵) = ∅, 𝐴, if(Lim dom (𝐹 ↾ 𝐵), ∪ ran (𝐹 ↾ 𝐵), (𝐻‘((𝐹 ↾ 𝐵)‘∪ dom (𝐹 ↾ 𝐵))))) = if(Lim dom (𝐹 ↾ 𝐵), ∪ ran (𝐹 ↾ 𝐵), (𝐻‘((𝐹 ↾ 𝐵)‘∪ dom (𝐹 ↾ 𝐵)))))
36		limeq 5735	. . . . . . . . . 10 ⊢ (dom (𝐹 ↾ 𝐵) = 𝐵 → (Lim dom (𝐹 ↾ 𝐵) ↔ Lim 𝐵))
37	25, 36	syl 17	. . . . . . . . 9 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → (Lim dom (𝐹 ↾ 𝐵) ↔ Lim 𝐵))
38	12, 37	mpbird 247	. . . . . . . 8 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → Lim dom (𝐹 ↾ 𝐵))
39	38	iftrued 4094	. . . . . . 7 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → if(Lim dom (𝐹 ↾ 𝐵), ∪ ran (𝐹 ↾ 𝐵), (𝐻‘((𝐹 ↾ 𝐵)‘∪ dom (𝐹 ↾ 𝐵)))) = ∪ ran (𝐹 ↾ 𝐵))
40	35, 39	eqtrd 2656	. . . . . 6 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → if((𝐹 ↾ 𝐵) = ∅, 𝐴, if(Lim dom (𝐹 ↾ 𝐵), ∪ ran (𝐹 ↾ 𝐵), (𝐻‘((𝐹 ↾ 𝐵)‘∪ dom (𝐹 ↾ 𝐵))))) = ∪ ran (𝐹 ↾ 𝐵))
41		rnexg 7098	. . . . . . 7 ⊢ ((𝐹 ↾ 𝐵) ∈ V → ran (𝐹 ↾ 𝐵) ∈ V)
42		uniexg 6955	. . . . . . 7 ⊢ (ran (𝐹 ↾ 𝐵) ∈ V → ∪ ran (𝐹 ↾ 𝐵) ∈ V)
43	11, 41, 42	3syl 18	. . . . . 6 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → ∪ ran (𝐹 ↾ 𝐵) ∈ V)
44	40, 43	eqeltrd 2701	. . . . 5 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → if((𝐹 ↾ 𝐵) = ∅, 𝐴, if(Lim dom (𝐹 ↾ 𝐵), ∪ ran (𝐹 ↾ 𝐵), (𝐻‘((𝐹 ↾ 𝐵)‘∪ dom (𝐹 ↾ 𝐵))))) ∈ V)
45		eqeq1 2626	. . . . . . 7 ⊢ (𝑥 = (𝐹 ↾ 𝐵) → (𝑥 = ∅ ↔ (𝐹 ↾ 𝐵) = ∅))
46		dmeq 5324	. . . . . . . . 9 ⊢ (𝑥 = (𝐹 ↾ 𝐵) → dom 𝑥 = dom (𝐹 ↾ 𝐵))
47		limeq 5735	. . . . . . . . 9 ⊢ (dom 𝑥 = dom (𝐹 ↾ 𝐵) → (Lim dom 𝑥 ↔ Lim dom (𝐹 ↾ 𝐵)))
48	46, 47	syl 17	. . . . . . . 8 ⊢ (𝑥 = (𝐹 ↾ 𝐵) → (Lim dom 𝑥 ↔ Lim dom (𝐹 ↾ 𝐵)))
49		rneq 5351	. . . . . . . . 9 ⊢ (𝑥 = (𝐹 ↾ 𝐵) → ran 𝑥 = ran (𝐹 ↾ 𝐵))
50	49	unieqd 4446	. . . . . . . 8 ⊢ (𝑥 = (𝐹 ↾ 𝐵) → ∪ ran 𝑥 = ∪ ran (𝐹 ↾ 𝐵))
51		fveq1 6190	. . . . . . . . . 10 ⊢ (𝑥 = (𝐹 ↾ 𝐵) → (𝑥‘∪ dom 𝑥) = ((𝐹 ↾ 𝐵)‘∪ dom 𝑥))
52	46	unieqd 4446	. . . . . . . . . . 11 ⊢ (𝑥 = (𝐹 ↾ 𝐵) → ∪ dom 𝑥 = ∪ dom (𝐹 ↾ 𝐵))
53	52	fveq2d 6195	. . . . . . . . . 10 ⊢ (𝑥 = (𝐹 ↾ 𝐵) → ((𝐹 ↾ 𝐵)‘∪ dom 𝑥) = ((𝐹 ↾ 𝐵)‘∪ dom (𝐹 ↾ 𝐵)))
54	51, 53	eqtrd 2656	. . . . . . . . 9 ⊢ (𝑥 = (𝐹 ↾ 𝐵) → (𝑥‘∪ dom 𝑥) = ((𝐹 ↾ 𝐵)‘∪ dom (𝐹 ↾ 𝐵)))
55	54	fveq2d 6195	. . . . . . . 8 ⊢ (𝑥 = (𝐹 ↾ 𝐵) → (𝐻‘(𝑥‘∪ dom 𝑥)) = (𝐻‘((𝐹 ↾ 𝐵)‘∪ dom (𝐹 ↾ 𝐵))))
56	48, 50, 55	ifbieq12d 4113	. . . . . . 7 ⊢ (𝑥 = (𝐹 ↾ 𝐵) → if(Lim dom 𝑥, ∪ ran 𝑥, (𝐻‘(𝑥‘∪ dom 𝑥))) = if(Lim dom (𝐹 ↾ 𝐵), ∪ ran (𝐹 ↾ 𝐵), (𝐻‘((𝐹 ↾ 𝐵)‘∪ dom (𝐹 ↾ 𝐵)))))
57	45, 56	ifbieq2d 4111	. . . . . 6 ⊢ (𝑥 = (𝐹 ↾ 𝐵) → if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ∪ ran 𝑥, (𝐻‘(𝑥‘∪ dom 𝑥)))) = if((𝐹 ↾ 𝐵) = ∅, 𝐴, if(Lim dom (𝐹 ↾ 𝐵), ∪ ran (𝐹 ↾ 𝐵), (𝐻‘((𝐹 ↾ 𝐵)‘∪ dom (𝐹 ↾ 𝐵))))))
58		tz7.44.1	. . . . . 6 ⊢ 𝐺 = (𝑥 ∈ V ↦ if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ∪ ran 𝑥, (𝐻‘(𝑥‘∪ dom 𝑥)))))
59	57, 58	fvmptg 6280	. . . . 5 ⊢ (((𝐹 ↾ 𝐵) ∈ V ∧ if((𝐹 ↾ 𝐵) = ∅, 𝐴, if(Lim dom (𝐹 ↾ 𝐵), ∪ ran (𝐹 ↾ 𝐵), (𝐻‘((𝐹 ↾ 𝐵)‘∪ dom (𝐹 ↾ 𝐵))))) ∈ V) → (𝐺‘(𝐹 ↾ 𝐵)) = if((𝐹 ↾ 𝐵) = ∅, 𝐴, if(Lim dom (𝐹 ↾ 𝐵), ∪ ran (𝐹 ↾ 𝐵), (𝐻‘((𝐹 ↾ 𝐵)‘∪ dom (𝐹 ↾ 𝐵))))))
60	11, 44, 59	syl2anc 693	. . . 4 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → (𝐺‘(𝐹 ↾ 𝐵)) = if((𝐹 ↾ 𝐵) = ∅, 𝐴, if(Lim dom (𝐹 ↾ 𝐵), ∪ ran (𝐹 ↾ 𝐵), (𝐻‘((𝐹 ↾ 𝐵)‘∪ dom (𝐹 ↾ 𝐵))))))
61	60, 40	eqtrd 2656	. . 3 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → (𝐺‘(𝐹 ↾ 𝐵)) = ∪ ran (𝐹 ↾ 𝐵))
62	7, 61	eqtrd 2656	. 2 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → (𝐹‘𝐵) = ∪ ran (𝐹 ↾ 𝐵))
63		df-ima 5127	. . 3 ⊢ (𝐹 “ 𝐵) = ran (𝐹 ↾ 𝐵)
64	63	unieqi 4445	. 2 ⊢ ∪ (𝐹 “ 𝐵) = ∪ ran (𝐹 ↾ 𝐵)
65	62, 64	syl6eqr 2674	1 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → (𝐹‘𝐵) = ∪ (𝐹 “ 𝐵))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 196   ∧ wa 384   = wceq 1483   ∈ wcel 1990  Vcvv 3200   ∩ cin 3573   ⊆ wss 3574  ∅c0 3915  ifcif 4086  ∪ cuni 4436   ↦ cmpt 4729  dom cdm 5114  ran crn 5115   ↾ cres 5116   “ cima 5117  Ord word 5722  Lim wlim 5724   Fn wfn 5883  ‘cfv 5888

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906  ax-un 6949

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-ord 5726  df-lim 5728  df-iota 5851  df-fun 5890  df-fn 5891  df-fv 5896

This theorem is referenced by:  rdglimg  7521