MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  tz7.44-2 Structured version   Visualization version   GIF version

Theorem tz7.44-2 8121
Description: The value of 𝐹 at a successor ordinal. Part 2 of Theorem 7.44 of [TakeutiZaring] p. 49. (Contributed by NM, 23-Apr-1995.) Remove unnecessary distinct variable conditions. (Revised by David Abernethy, 19-Jun-2012.) (Revised by Mario Carneiro, 14-Nov-2014.)
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-2 (suc 𝐵𝑋 → (𝐹‘suc 𝐵) = (𝐻‘(𝐹𝐵)))
Distinct variable groups:   𝑥,𝐴   𝑥,𝑦,𝐵   𝑥,𝐹,𝑦   𝑦,𝐺   𝑥,𝐻   𝑦,𝑋
Allowed substitution hints:   𝐴(𝑦)   𝐺(𝑥)   𝐻(𝑦)   𝑋(𝑥)

Proof of Theorem tz7.44-2
StepHypRef Expression
1 fveq2 6695 . . . 4 (𝑦 = suc 𝐵 → (𝐹𝑦) = (𝐹‘suc 𝐵))
2 reseq2 5831 . . . . 5 (𝑦 = suc 𝐵 → (𝐹𝑦) = (𝐹 ↾ suc 𝐵))
32fveq2d 6699 . . . 4 (𝑦 = suc 𝐵 → (𝐺‘(𝐹𝑦)) = (𝐺‘(𝐹 ↾ suc 𝐵)))
41, 3eqeq12d 2752 . . 3 (𝑦 = suc 𝐵 → ((𝐹𝑦) = (𝐺‘(𝐹𝑦)) ↔ (𝐹‘suc 𝐵) = (𝐺‘(𝐹 ↾ suc 𝐵))))
5 tz7.44.2 . . 3 (𝑦𝑋 → (𝐹𝑦) = (𝐺‘(𝐹𝑦)))
64, 5vtoclga 3479 . 2 (suc 𝐵𝑋 → (𝐹‘suc 𝐵) = (𝐺‘(𝐹 ↾ suc 𝐵)))
7 tz7.44.1 . . 3 𝐺 = (𝑥 ∈ V ↦ if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ran 𝑥, (𝐻‘(𝑥 dom 𝑥)))))
8 eqeq1 2740 . . . 4 (𝑥 = (𝐹 ↾ suc 𝐵) → (𝑥 = ∅ ↔ (𝐹 ↾ suc 𝐵) = ∅))
9 dmeq 5757 . . . . . 6 (𝑥 = (𝐹 ↾ suc 𝐵) → dom 𝑥 = dom (𝐹 ↾ suc 𝐵))
10 limeq 6203 . . . . . 6 (dom 𝑥 = dom (𝐹 ↾ suc 𝐵) → (Lim dom 𝑥 ↔ Lim dom (𝐹 ↾ suc 𝐵)))
119, 10syl 17 . . . . 5 (𝑥 = (𝐹 ↾ suc 𝐵) → (Lim dom 𝑥 ↔ Lim dom (𝐹 ↾ suc 𝐵)))
12 rneq 5790 . . . . . 6 (𝑥 = (𝐹 ↾ suc 𝐵) → ran 𝑥 = ran (𝐹 ↾ suc 𝐵))
1312unieqd 4819 . . . . 5 (𝑥 = (𝐹 ↾ suc 𝐵) → ran 𝑥 = ran (𝐹 ↾ suc 𝐵))
14 fveq1 6694 . . . . . . 7 (𝑥 = (𝐹 ↾ suc 𝐵) → (𝑥 dom 𝑥) = ((𝐹 ↾ suc 𝐵)‘ dom 𝑥))
159unieqd 4819 . . . . . . . 8 (𝑥 = (𝐹 ↾ suc 𝐵) → dom 𝑥 = dom (𝐹 ↾ suc 𝐵))
1615fveq2d 6699 . . . . . . 7 (𝑥 = (𝐹 ↾ suc 𝐵) → ((𝐹 ↾ suc 𝐵)‘ dom 𝑥) = ((𝐹 ↾ suc 𝐵)‘ dom (𝐹 ↾ suc 𝐵)))
1714, 16eqtrd 2771 . . . . . 6 (𝑥 = (𝐹 ↾ suc 𝐵) → (𝑥 dom 𝑥) = ((𝐹 ↾ suc 𝐵)‘ dom (𝐹 ↾ suc 𝐵)))
1817fveq2d 6699 . . . . 5 (𝑥 = (𝐹 ↾ suc 𝐵) → (𝐻‘(𝑥 dom 𝑥)) = (𝐻‘((𝐹 ↾ suc 𝐵)‘ dom (𝐹 ↾ suc 𝐵))))
1911, 13, 18ifbieq12d 4453 . . . 4 (𝑥 = (𝐹 ↾ suc 𝐵) → if(Lim dom 𝑥, ran 𝑥, (𝐻‘(𝑥 dom 𝑥))) = if(Lim dom (𝐹 ↾ suc 𝐵), ran (𝐹 ↾ suc 𝐵), (𝐻‘((𝐹 ↾ suc 𝐵)‘ dom (𝐹 ↾ suc 𝐵)))))
208, 19ifbieq2d 4451 . . 3 (𝑥 = (𝐹 ↾ suc 𝐵) → if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ran 𝑥, (𝐻‘(𝑥 dom 𝑥)))) = if((𝐹 ↾ suc 𝐵) = ∅, 𝐴, if(Lim dom (𝐹 ↾ suc 𝐵), ran (𝐹 ↾ suc 𝐵), (𝐻‘((𝐹 ↾ suc 𝐵)‘ dom (𝐹 ↾ suc 𝐵))))))
212eleq1d 2815 . . . 4 (𝑦 = suc 𝐵 → ((𝐹𝑦) ∈ V ↔ (𝐹 ↾ suc 𝐵) ∈ V))
22 tz7.44.3 . . . 4 (𝑦𝑋 → (𝐹𝑦) ∈ V)
2321, 22vtoclga 3479 . . 3 (suc 𝐵𝑋 → (𝐹 ↾ suc 𝐵) ∈ V)
24 noel 4231 . . . . . . 7 ¬ 𝐵 ∈ ∅
25 dmeq 5757 . . . . . . . . 9 ((𝐹 ↾ suc 𝐵) = ∅ → dom (𝐹 ↾ suc 𝐵) = dom ∅)
26 dm0 5774 . . . . . . . . 9 dom ∅ = ∅
2725, 26eqtrdi 2787 . . . . . . . 8 ((𝐹 ↾ suc 𝐵) = ∅ → dom (𝐹 ↾ suc 𝐵) = ∅)
28 tz7.44.5 . . . . . . . . . . . . 13 Ord 𝑋
29 ordsson 7545 . . . . . . . . . . . . 13 (Ord 𝑋𝑋 ⊆ On)
3028, 29ax-mp 5 . . . . . . . . . . . 12 𝑋 ⊆ On
31 ordtr 6205 . . . . . . . . . . . . . 14 (Ord 𝑋 → Tr 𝑋)
3228, 31ax-mp 5 . . . . . . . . . . . . 13 Tr 𝑋
33 trsuc 6275 . . . . . . . . . . . . 13 ((Tr 𝑋 ∧ suc 𝐵𝑋) → 𝐵𝑋)
3432, 33mpan 690 . . . . . . . . . . . 12 (suc 𝐵𝑋𝐵𝑋)
3530, 34sseldi 3885 . . . . . . . . . . 11 (suc 𝐵𝑋𝐵 ∈ On)
36 sucidg 6269 . . . . . . . . . . 11 (𝐵 ∈ On → 𝐵 ∈ suc 𝐵)
3735, 36syl 17 . . . . . . . . . 10 (suc 𝐵𝑋𝐵 ∈ suc 𝐵)
38 dmres 5858 . . . . . . . . . . 11 dom (𝐹 ↾ suc 𝐵) = (suc 𝐵 ∩ dom 𝐹)
39 ordelss 6207 . . . . . . . . . . . . . 14 ((Ord 𝑋 ∧ suc 𝐵𝑋) → suc 𝐵𝑋)
4028, 39mpan 690 . . . . . . . . . . . . 13 (suc 𝐵𝑋 → suc 𝐵𝑋)
41 tz7.44.4 . . . . . . . . . . . . . 14 𝐹 Fn 𝑋
4241fndmi 6460 . . . . . . . . . . . . 13 dom 𝐹 = 𝑋
4340, 42sseqtrrdi 3938 . . . . . . . . . . . 12 (suc 𝐵𝑋 → suc 𝐵 ⊆ dom 𝐹)
44 df-ss 3870 . . . . . . . . . . . 12 (suc 𝐵 ⊆ dom 𝐹 ↔ (suc 𝐵 ∩ dom 𝐹) = suc 𝐵)
4543, 44sylib 221 . . . . . . . . . . 11 (suc 𝐵𝑋 → (suc 𝐵 ∩ dom 𝐹) = suc 𝐵)
4638, 45syl5eq 2783 . . . . . . . . . 10 (suc 𝐵𝑋 → dom (𝐹 ↾ suc 𝐵) = suc 𝐵)
4737, 46eleqtrrd 2834 . . . . . . . . 9 (suc 𝐵𝑋𝐵 ∈ dom (𝐹 ↾ suc 𝐵))
48 eleq2 2819 . . . . . . . . 9 (dom (𝐹 ↾ suc 𝐵) = ∅ → (𝐵 ∈ dom (𝐹 ↾ suc 𝐵) ↔ 𝐵 ∈ ∅))
4947, 48syl5ibcom 248 . . . . . . . 8 (suc 𝐵𝑋 → (dom (𝐹 ↾ suc 𝐵) = ∅ → 𝐵 ∈ ∅))
5027, 49syl5 34 . . . . . . 7 (suc 𝐵𝑋 → ((𝐹 ↾ suc 𝐵) = ∅ → 𝐵 ∈ ∅))
5124, 50mtoi 202 . . . . . 6 (suc 𝐵𝑋 → ¬ (𝐹 ↾ suc 𝐵) = ∅)
5251iffalsed 4436 . . . . 5 (suc 𝐵𝑋 → if((𝐹 ↾ suc 𝐵) = ∅, 𝐴, if(Lim dom (𝐹 ↾ suc 𝐵), ran (𝐹 ↾ suc 𝐵), (𝐻‘((𝐹 ↾ suc 𝐵)‘ dom (𝐹 ↾ suc 𝐵))))) = if(Lim dom (𝐹 ↾ suc 𝐵), ran (𝐹 ↾ suc 𝐵), (𝐻‘((𝐹 ↾ suc 𝐵)‘ dom (𝐹 ↾ suc 𝐵)))))
53 nlimsucg 7599 . . . . . . . 8 (𝐵 ∈ On → ¬ Lim suc 𝐵)
5435, 53syl 17 . . . . . . 7 (suc 𝐵𝑋 → ¬ Lim suc 𝐵)
55 limeq 6203 . . . . . . . 8 (dom (𝐹 ↾ suc 𝐵) = suc 𝐵 → (Lim dom (𝐹 ↾ suc 𝐵) ↔ Lim suc 𝐵))
5646, 55syl 17 . . . . . . 7 (suc 𝐵𝑋 → (Lim dom (𝐹 ↾ suc 𝐵) ↔ Lim suc 𝐵))
5754, 56mtbird 328 . . . . . 6 (suc 𝐵𝑋 → ¬ Lim dom (𝐹 ↾ suc 𝐵))
5857iffalsed 4436 . . . . 5 (suc 𝐵𝑋 → if(Lim dom (𝐹 ↾ suc 𝐵), ran (𝐹 ↾ suc 𝐵), (𝐻‘((𝐹 ↾ suc 𝐵)‘ dom (𝐹 ↾ suc 𝐵)))) = (𝐻‘((𝐹 ↾ suc 𝐵)‘ dom (𝐹 ↾ suc 𝐵))))
5946unieqd 4819 . . . . . . . . 9 (suc 𝐵𝑋 dom (𝐹 ↾ suc 𝐵) = suc 𝐵)
60 eloni 6201 . . . . . . . . . 10 (𝐵 ∈ On → Ord 𝐵)
61 ordunisuc 7589 . . . . . . . . . 10 (Ord 𝐵 suc 𝐵 = 𝐵)
6235, 60, 613syl 18 . . . . . . . . 9 (suc 𝐵𝑋 suc 𝐵 = 𝐵)
6359, 62eqtrd 2771 . . . . . . . 8 (suc 𝐵𝑋 dom (𝐹 ↾ suc 𝐵) = 𝐵)
6463fveq2d 6699 . . . . . . 7 (suc 𝐵𝑋 → ((𝐹 ↾ suc 𝐵)‘ dom (𝐹 ↾ suc 𝐵)) = ((𝐹 ↾ suc 𝐵)‘𝐵))
6537fvresd 6715 . . . . . . 7 (suc 𝐵𝑋 → ((𝐹 ↾ suc 𝐵)‘𝐵) = (𝐹𝐵))
6664, 65eqtrd 2771 . . . . . 6 (suc 𝐵𝑋 → ((𝐹 ↾ suc 𝐵)‘ dom (𝐹 ↾ suc 𝐵)) = (𝐹𝐵))
6766fveq2d 6699 . . . . 5 (suc 𝐵𝑋 → (𝐻‘((𝐹 ↾ suc 𝐵)‘ dom (𝐹 ↾ suc 𝐵))) = (𝐻‘(𝐹𝐵)))
6852, 58, 673eqtrd 2775 . . . 4 (suc 𝐵𝑋 → if((𝐹 ↾ suc 𝐵) = ∅, 𝐴, if(Lim dom (𝐹 ↾ suc 𝐵), ran (𝐹 ↾ suc 𝐵), (𝐻‘((𝐹 ↾ suc 𝐵)‘ dom (𝐹 ↾ suc 𝐵))))) = (𝐻‘(𝐹𝐵)))
69 fvex 6708 . . . 4 (𝐻‘(𝐹𝐵)) ∈ V
7068, 69eqeltrdi 2839 . . 3 (suc 𝐵𝑋 → if((𝐹 ↾ suc 𝐵) = ∅, 𝐴, if(Lim dom (𝐹 ↾ suc 𝐵), ran (𝐹 ↾ suc 𝐵), (𝐻‘((𝐹 ↾ suc 𝐵)‘ dom (𝐹 ↾ suc 𝐵))))) ∈ V)
717, 20, 23, 70fvmptd3 6819 . 2 (suc 𝐵𝑋 → (𝐺‘(𝐹 ↾ suc 𝐵)) = if((𝐹 ↾ suc 𝐵) = ∅, 𝐴, if(Lim dom (𝐹 ↾ suc 𝐵), ran (𝐹 ↾ suc 𝐵), (𝐻‘((𝐹 ↾ suc 𝐵)‘ dom (𝐹 ↾ suc 𝐵))))))
726, 71, 683eqtrd 2775 1 (suc 𝐵𝑋 → (𝐹‘suc 𝐵) = (𝐻‘(𝐹𝐵)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209   = wceq 1543  wcel 2112  Vcvv 3398  cin 3852  wss 3853  c0 4223  ifcif 4425   cuni 4805  cmpt 5120  Tr wtr 5146  dom cdm 5536  ran crn 5537  cres 5538  Ord word 6190  Oncon0 6191  Lim wlim 6192  suc csuc 6193   Fn wfn 6353  cfv 6358
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2018  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2160  ax-12 2177  ax-ext 2708  ax-sep 5177  ax-nul 5184  ax-pr 5307  ax-un 7501
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3or 1090  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2073  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2728  df-clel 2809  df-nfc 2879  df-ne 2933  df-ral 3056  df-rex 3057  df-rab 3060  df-v 3400  df-sbc 3684  df-dif 3856  df-un 3858  df-in 3860  df-ss 3870  df-pss 3872  df-nul 4224  df-if 4426  df-sn 4528  df-pr 4530  df-tp 4532  df-op 4534  df-uni 4806  df-br 5040  df-opab 5102  df-mpt 5121  df-tr 5147  df-id 5440  df-eprel 5445  df-po 5453  df-so 5454  df-fr 5494  df-we 5496  df-xp 5542  df-rel 5543  df-cnv 5544  df-co 5545  df-dm 5546  df-rn 5547  df-res 5548  df-ord 6194  df-on 6195  df-lim 6196  df-suc 6197  df-iota 6316  df-fun 6360  df-fn 6361  df-fv 6366
This theorem is referenced by:  rdgsucg  8137
  Copyright terms: Public domain W3C validator