Theorem tz7.44-3 8394

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 6873	. . . . . 6 ⊢ (𝑦 = 𝐵 → (𝐹‘𝑦) = (𝐹‘𝐵))
2		reseq2 5961	. . . . . . 7 ⊢ (𝑦 = 𝐵 → (𝐹 ↾ 𝑦) = (𝐹 ↾ 𝐵))
3	2	fveq2d 6877	. . . . . 6 ⊢ (𝑦 = 𝐵 → (𝐺‘(𝐹 ↾ 𝑦)) = (𝐺‘(𝐹 ↾ 𝐵)))
4	1, 3	eqeq12d 2776	. . . . 5 ⊢ (𝑦 = 𝐵 → ((𝐹‘𝑦) = (𝐺‘(𝐹 ↾ 𝑦)) ↔ (𝐹‘𝐵) = (𝐺‘(𝐹 ↾ 𝐵))))
5		tz7.44.2	. . . . 5 ⊢ (𝑦 ∈ 𝑋 → (𝐹‘𝑦) = (𝐺‘(𝐹 ↾ 𝑦)))
6	4, 5	vtoclga 3536	. . . 4 ⊢ (𝐵 ∈ 𝑋 → (𝐹‘𝐵) = (𝐺‘(𝐹 ↾ 𝐵)))
7	6	adantr 486	. . 3 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → (𝐹‘𝐵) = (𝐺‘(𝐹 ↾ 𝐵)))
8	2	eleq1d 2845	. . . . . . 7 ⊢ (𝑦 = 𝐵 → ((𝐹 ↾ 𝑦) ∈ V ↔ (𝐹 ↾ 𝐵) ∈ V))
9		tz7.44.3	. . . . . . 7 ⊢ (𝑦 ∈ 𝑋 → (𝐹 ↾ 𝑦) ∈ V)
10	8, 9	vtoclga 3536	. . . . . 6 ⊢ (𝐵 ∈ 𝑋 → (𝐹 ↾ 𝐵) ∈ V)
11	10	adantr 486	. . . . 5 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → (𝐹 ↾ 𝐵) ∈ V)
12		simpr 490	. . . . . . . . 9 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → Lim 𝐵)
13		nlim0 6412	. . . . . . . . . . 11 ⊢ ¬ Lim ∅
14		dmres 5999	. . . . . . . . . . . . . 14 ⊢ dom (𝐹 ↾ 𝐵) = (𝐵 ∩ dom 𝐹)
15		tz7.44.5	. . . . . . . . . . . . . . . . . 18 ⊢ Ord 𝑋
16		ordelss 6367	. . . . . . . . . . . . . . . . . 18 ⊢ ((Ord 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐵 ⊆ 𝑋)
17	15, 16	mpan 703	. . . . . . . . . . . . . . . . 17 ⊢ (𝐵 ∈ 𝑋 → 𝐵 ⊆ 𝑋)
18	17	adantr 486	. . . . . . . . . . . . . . . 16 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → 𝐵 ⊆ 𝑋)
19		tz7.44.4	. . . . . . . . . . . . . . . . 17 ⊢ 𝐹 Fn 𝑋
20		fndm 6630	. . . . . . . . . . . . . . . . 17 ⊢ (𝐹 Fn 𝑋 → dom 𝐹 = 𝑋)
21	19, 20	ax-mp 5	. . . . . . . . . . . . . . . 16 ⊢ dom 𝐹 = 𝑋
22	18, 21	sseqtrrdi 3971	. . . . . . . . . . . . . . 15 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → 𝐵 ⊆ dom 𝐹)
23		dfss2 3916	. . . . . . . . . . . . . . 15 ⊢ (𝐵 ⊆ dom 𝐹 ↔ (𝐵 ∩ dom 𝐹) = 𝐵)
24	22, 23	sylib 221	. . . . . . . . . . . . . 14 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → (𝐵 ∩ dom 𝐹) = 𝐵)
25	14, 24	eqtrid 2807	. . . . . . . . . . . . 13 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → dom (𝐹 ↾ 𝐵) = 𝐵)
26		dmeq 5881	. . . . . . . . . . . . . 14 ⊢ ((𝐹 ↾ 𝐵) = ∅ → dom (𝐹 ↾ 𝐵) = dom ∅)
27		dm0 5898	. . . . . . . . . . . . . 14 ⊢ dom ∅ = ∅
28	26, 27	eqtrdi 2811	. . . . . . . . . . . . 13 ⊢ ((𝐹 ↾ 𝐵) = ∅ → dom (𝐹 ↾ 𝐵) = ∅)
29	25, 28	sylan9req 2816	. . . . . . . . . . . 12 ⊢ (((𝐵 ∈ 𝑋 ∧ Lim 𝐵) ∧ (𝐹 ↾ 𝐵) = ∅) → 𝐵 = ∅)
30		limeq 6363	. . . . . . . . . . . 12 ⊢ (𝐵 = ∅ → (Lim 𝐵 ↔ Lim ∅))
31	29, 30	syl 18	. . . . . . . . . . 11 ⊢ (((𝐵 ∈ 𝑋 ∧ Lim 𝐵) ∧ (𝐹 ↾ 𝐵) = ∅) → (Lim 𝐵 ↔ Lim ∅))
32	13, 31	mtbiri 330	. . . . . . . . . 10 ⊢ (((𝐵 ∈ 𝑋 ∧ Lim 𝐵) ∧ (𝐹 ↾ 𝐵) = ∅) → ¬ Lim 𝐵)
33	32	ex 418	. . . . . . . . 9 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → ((𝐹 ↾ 𝐵) = ∅ → ¬ Lim 𝐵))
34	12, 33	mt2d 137	. . . . . . . 8 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → ¬ (𝐹 ↾ 𝐵) = ∅)
35	34	iffalsed 4492	. . . . . . 7 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → if((𝐹 ↾ 𝐵) = ∅, 𝐴, if(Lim dom (𝐹 ↾ 𝐵), ∪ ran (𝐹 ↾ 𝐵), (𝐻‘((𝐹 ↾ 𝐵)‘∪ dom (𝐹 ↾ 𝐵))))) = if(Lim dom (𝐹 ↾ 𝐵), ∪ ran (𝐹 ↾ 𝐵), (𝐻‘((𝐹 ↾ 𝐵)‘∪ dom (𝐹 ↾ 𝐵)))))
36		limeq 6363	. . . . . . . . . 10 ⊢ (dom (𝐹 ↾ 𝐵) = 𝐵 → (Lim dom (𝐹 ↾ 𝐵) ↔ Lim 𝐵))
37	25, 36	syl 18	. . . . . . . . 9 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → (Lim dom (𝐹 ↾ 𝐵) ↔ Lim 𝐵))
38	12, 37	mpbird 260	. . . . . . . 8 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → Lim dom (𝐹 ↾ 𝐵))
39	38	iftrued 4489	. . . . . . 7 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → if(Lim dom (𝐹 ↾ 𝐵), ∪ ran (𝐹 ↾ 𝐵), (𝐻‘((𝐹 ↾ 𝐵)‘∪ dom (𝐹 ↾ 𝐵)))) = ∪ ran (𝐹 ↾ 𝐵))
40	35, 39	eqtrd 2795	. . . . . 6 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → if((𝐹 ↾ 𝐵) = ∅, 𝐴, if(Lim dom (𝐹 ↾ 𝐵), ∪ ran (𝐹 ↾ 𝐵), (𝐻‘((𝐹 ↾ 𝐵)‘∪ dom (𝐹 ↾ 𝐵))))) = ∪ ran (𝐹 ↾ 𝐵))
41		rnexg 7897	. . . . . . 7 ⊢ ((𝐹 ↾ 𝐵) ∈ V → ran (𝐹 ↾ 𝐵) ∈ V)
42		uniexg 7740	. . . . . . 7 ⊢ (ran (𝐹 ↾ 𝐵) ∈ V → ∪ ran (𝐹 ↾ 𝐵) ∈ V)
43	11, 41, 42	3syl 19	. . . . . 6 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → ∪ ran (𝐹 ↾ 𝐵) ∈ V)
44	40, 43	eqeltrd 2860	. . . . 5 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → if((𝐹 ↾ 𝐵) = ∅, 𝐴, if(Lim dom (𝐹 ↾ 𝐵), ∪ ran (𝐹 ↾ 𝐵), (𝐻‘((𝐹 ↾ 𝐵)‘∪ dom (𝐹 ↾ 𝐵))))) ∈ V)
45		eqeq1 2764	. . . . . . 7 ⊢ (𝑥 = (𝐹 ↾ 𝐵) → (𝑥 = ∅ ↔ (𝐹 ↾ 𝐵) = ∅))
46		dmeq 5881	. . . . . . . . 9 ⊢ (𝑥 = (𝐹 ↾ 𝐵) → dom 𝑥 = dom (𝐹 ↾ 𝐵))
47		limeq 6363	. . . . . . . . 9 ⊢ (dom 𝑥 = dom (𝐹 ↾ 𝐵) → (Lim dom 𝑥 ↔ Lim dom (𝐹 ↾ 𝐵)))
48	46, 47	syl 18	. . . . . . . 8 ⊢ (𝑥 = (𝐹 ↾ 𝐵) → (Lim dom 𝑥 ↔ Lim dom (𝐹 ↾ 𝐵)))
49		rneq 5914	. . . . . . . . 9 ⊢ (𝑥 = (𝐹 ↾ 𝐵) → ran 𝑥 = ran (𝐹 ↾ 𝐵))
50	49	unieqd 4879	. . . . . . . 8 ⊢ (𝑥 = (𝐹 ↾ 𝐵) → ∪ ran 𝑥 = ∪ ran (𝐹 ↾ 𝐵))
51		fveq1 6872	. . . . . . . . . 10 ⊢ (𝑥 = (𝐹 ↾ 𝐵) → (𝑥‘∪ dom 𝑥) = ((𝐹 ↾ 𝐵)‘∪ dom 𝑥))
52	46	unieqd 4879	. . . . . . . . . . 11 ⊢ (𝑥 = (𝐹 ↾ 𝐵) → ∪ dom 𝑥 = ∪ dom (𝐹 ↾ 𝐵))
53	52	fveq2d 6877	. . . . . . . . . 10 ⊢ (𝑥 = (𝐹 ↾ 𝐵) → ((𝐹 ↾ 𝐵)‘∪ dom 𝑥) = ((𝐹 ↾ 𝐵)‘∪ dom (𝐹 ↾ 𝐵)))
54	51, 53	eqtrd 2795	. . . . . . . . 9 ⊢ (𝑥 = (𝐹 ↾ 𝐵) → (𝑥‘∪ dom 𝑥) = ((𝐹 ↾ 𝐵)‘∪ dom (𝐹 ↾ 𝐵)))
55	54	fveq2d 6877	. . . . . . . 8 ⊢ (𝑥 = (𝐹 ↾ 𝐵) → (𝐻‘(𝑥‘∪ dom 𝑥)) = (𝐻‘((𝐹 ↾ 𝐵)‘∪ dom (𝐹 ↾ 𝐵))))
56	48, 50, 55	ifbieq12d 4510	. . . . . . 7 ⊢ (𝑥 = (𝐹 ↾ 𝐵) → if(Lim dom 𝑥, ∪ ran 𝑥, (𝐻‘(𝑥‘∪ dom 𝑥))) = if(Lim dom (𝐹 ↾ 𝐵), ∪ ran (𝐹 ↾ 𝐵), (𝐻‘((𝐹 ↾ 𝐵)‘∪ dom (𝐹 ↾ 𝐵)))))
57	45, 56	ifbieq2d 4508	. . . . . 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 6979	. . . . 5 ⊢ (((𝐹 ↾ 𝐵) ∈ V ∧ if((𝐹 ↾ 𝐵) = ∅, 𝐴, if(Lim dom (𝐹 ↾ 𝐵), ∪ ran (𝐹 ↾ 𝐵), (𝐻‘((𝐹 ↾ 𝐵)‘∪ dom (𝐹 ↾ 𝐵))))) ∈ V) → (𝐺‘(𝐹 ↾ 𝐵)) = if((𝐹 ↾ 𝐵) = ∅, 𝐴, if(Lim dom (𝐹 ↾ 𝐵), ∪ ran (𝐹 ↾ 𝐵), (𝐻‘((𝐹 ↾ 𝐵)‘∪ dom (𝐹 ↾ 𝐵))))))
60	11, 44, 59	syl2anc 596	. . . 4 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → (𝐺‘(𝐹 ↾ 𝐵)) = if((𝐹 ↾ 𝐵) = ∅, 𝐴, if(Lim dom (𝐹 ↾ 𝐵), ∪ ran (𝐹 ↾ 𝐵), (𝐻‘((𝐹 ↾ 𝐵)‘∪ dom (𝐹 ↾ 𝐵))))))
61	60, 40	eqtrd 2795	. . 3 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → (𝐺‘(𝐹 ↾ 𝐵)) = ∪ ran (𝐹 ↾ 𝐵))
62	7, 61	eqtrd 2795	. 2 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → (𝐹‘𝐵) = ∪ ran (𝐹 ↾ 𝐵))
63		df-ima 5660	. . 3 ⊢ (𝐹 “ 𝐵) = ran (𝐹 ↾ 𝐵)
64	63	unieqi 4878	. 2 ⊢ ∪ (𝐹 “ 𝐵) = ∪ ran (𝐹 ↾ 𝐵)
65	62, 64	eqtr4di 2813	1 ⊢ ((𝐵 ∈ 𝑋 ∧ Lim 𝐵) → (𝐹‘𝐵) = ∪ (𝐹 “ 𝐵))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3450   ∩ cin 3897   ⊆ wss 3898  ∅c0 4278  ifcif 4481  ∪ cuni 4866   ↦ cmpt 5185  dom cdm 5647  ran crn 5648   ↾ cres 5649   “ cima 5650  Ord word 6350  Lim wlim 6352   Fn wfn 6522  ‘cfv 6527

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-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5248  ax-pr 5390  ax-un 7734

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-ord 6354  df-lim 6356  df-iota 6483  df-fun 6529  df-fn 6530  df-fv 6535

This theorem is used by:  rdglimg  8411