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

Theorem tz7.44-3 8342
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
StepHypRef Expression
1 fveq2 6836 . . . . . 6 (𝑦 = 𝐵 → (𝐹𝑦) = (𝐹𝐵))
2 reseq2 5935 . . . . . . 7 (𝑦 = 𝐵 → (𝐹𝑦) = (𝐹𝐵))
32fveq2d 6840 . . . . . 6 (𝑦 = 𝐵 → (𝐺‘(𝐹𝑦)) = (𝐺‘(𝐹𝐵)))
41, 3eqeq12d 2753 . . . . 5 (𝑦 = 𝐵 → ((𝐹𝑦) = (𝐺‘(𝐹𝑦)) ↔ (𝐹𝐵) = (𝐺‘(𝐹𝐵))))
5 tz7.44.2 . . . . 5 (𝑦𝑋 → (𝐹𝑦) = (𝐺‘(𝐹𝑦)))
64, 5vtoclga 3521 . . . 4 (𝐵𝑋 → (𝐹𝐵) = (𝐺‘(𝐹𝐵)))
76adantr 480 . . 3 ((𝐵𝑋 ∧ Lim 𝐵) → (𝐹𝐵) = (𝐺‘(𝐹𝐵)))
82eleq1d 2822 . . . . . . 7 (𝑦 = 𝐵 → ((𝐹𝑦) ∈ V ↔ (𝐹𝐵) ∈ V))
9 tz7.44.3 . . . . . . 7 (𝑦𝑋 → (𝐹𝑦) ∈ V)
108, 9vtoclga 3521 . . . . . 6 (𝐵𝑋 → (𝐹𝐵) ∈ V)
1110adantr 480 . . . . 5 ((𝐵𝑋 ∧ Lim 𝐵) → (𝐹𝐵) ∈ V)
12 simpr 484 . . . . . . . . 9 ((𝐵𝑋 ∧ Lim 𝐵) → Lim 𝐵)
13 nlim0 6379 . . . . . . . . . . 11 ¬ Lim ∅
14 dmres 5973 . . . . . . . . . . . . . 14 dom (𝐹𝐵) = (𝐵 ∩ dom 𝐹)
15 tz7.44.5 . . . . . . . . . . . . . . . . . 18 Ord 𝑋
16 ordelss 6335 . . . . . . . . . . . . . . . . . 18 ((Ord 𝑋𝐵𝑋) → 𝐵𝑋)
1715, 16mpan 691 . . . . . . . . . . . . . . . . 17 (𝐵𝑋𝐵𝑋)
1817adantr 480 . . . . . . . . . . . . . . . 16 ((𝐵𝑋 ∧ Lim 𝐵) → 𝐵𝑋)
19 tz7.44.4 . . . . . . . . . . . . . . . . 17 𝐹 Fn 𝑋
20 fndm 6597 . . . . . . . . . . . . . . . . 17 (𝐹 Fn 𝑋 → dom 𝐹 = 𝑋)
2119, 20ax-mp 5 . . . . . . . . . . . . . . . 16 dom 𝐹 = 𝑋
2218, 21sseqtrrdi 3964 . . . . . . . . . . . . . . 15 ((𝐵𝑋 ∧ Lim 𝐵) → 𝐵 ⊆ dom 𝐹)
23 dfss2 3908 . . . . . . . . . . . . . . 15 (𝐵 ⊆ dom 𝐹 ↔ (𝐵 ∩ dom 𝐹) = 𝐵)
2422, 23sylib 218 . . . . . . . . . . . . . 14 ((𝐵𝑋 ∧ Lim 𝐵) → (𝐵 ∩ dom 𝐹) = 𝐵)
2514, 24eqtrid 2784 . . . . . . . . . . . . 13 ((𝐵𝑋 ∧ Lim 𝐵) → dom (𝐹𝐵) = 𝐵)
26 dmeq 5854 . . . . . . . . . . . . . 14 ((𝐹𝐵) = ∅ → dom (𝐹𝐵) = dom ∅)
27 dm0 5871 . . . . . . . . . . . . . 14 dom ∅ = ∅
2826, 27eqtrdi 2788 . . . . . . . . . . . . 13 ((𝐹𝐵) = ∅ → dom (𝐹𝐵) = ∅)
2925, 28sylan9req 2793 . . . . . . . . . . . 12 (((𝐵𝑋 ∧ Lim 𝐵) ∧ (𝐹𝐵) = ∅) → 𝐵 = ∅)
30 limeq 6331 . . . . . . . . . . . 12 (𝐵 = ∅ → (Lim 𝐵 ↔ Lim ∅))
3129, 30syl 17 . . . . . . . . . . 11 (((𝐵𝑋 ∧ Lim 𝐵) ∧ (𝐹𝐵) = ∅) → (Lim 𝐵 ↔ Lim ∅))
3213, 31mtbiri 327 . . . . . . . . . 10 (((𝐵𝑋 ∧ Lim 𝐵) ∧ (𝐹𝐵) = ∅) → ¬ Lim 𝐵)
3332ex 412 . . . . . . . . 9 ((𝐵𝑋 ∧ Lim 𝐵) → ((𝐹𝐵) = ∅ → ¬ Lim 𝐵))
3412, 33mt2d 136 . . . . . . . 8 ((𝐵𝑋 ∧ Lim 𝐵) → ¬ (𝐹𝐵) = ∅)
3534iffalsed 4478 . . . . . . 7 ((𝐵𝑋 ∧ Lim 𝐵) → if((𝐹𝐵) = ∅, 𝐴, if(Lim dom (𝐹𝐵), ran (𝐹𝐵), (𝐻‘((𝐹𝐵)‘ dom (𝐹𝐵))))) = if(Lim dom (𝐹𝐵), ran (𝐹𝐵), (𝐻‘((𝐹𝐵)‘ dom (𝐹𝐵)))))
36 limeq 6331 . . . . . . . . . 10 (dom (𝐹𝐵) = 𝐵 → (Lim dom (𝐹𝐵) ↔ Lim 𝐵))
3725, 36syl 17 . . . . . . . . 9 ((𝐵𝑋 ∧ Lim 𝐵) → (Lim dom (𝐹𝐵) ↔ Lim 𝐵))
3812, 37mpbird 257 . . . . . . . 8 ((𝐵𝑋 ∧ Lim 𝐵) → Lim dom (𝐹𝐵))
3938iftrued 4475 . . . . . . 7 ((𝐵𝑋 ∧ Lim 𝐵) → if(Lim dom (𝐹𝐵), ran (𝐹𝐵), (𝐻‘((𝐹𝐵)‘ dom (𝐹𝐵)))) = ran (𝐹𝐵))
4035, 39eqtrd 2772 . . . . . 6 ((𝐵𝑋 ∧ Lim 𝐵) → if((𝐹𝐵) = ∅, 𝐴, if(Lim dom (𝐹𝐵), ran (𝐹𝐵), (𝐻‘((𝐹𝐵)‘ dom (𝐹𝐵))))) = ran (𝐹𝐵))
41 rnexg 7848 . . . . . . 7 ((𝐹𝐵) ∈ V → ran (𝐹𝐵) ∈ V)
42 uniexg 7689 . . . . . . 7 (ran (𝐹𝐵) ∈ V → ran (𝐹𝐵) ∈ V)
4311, 41, 423syl 18 . . . . . 6 ((𝐵𝑋 ∧ Lim 𝐵) → ran (𝐹𝐵) ∈ V)
4440, 43eqeltrd 2837 . . . . 5 ((𝐵𝑋 ∧ Lim 𝐵) → if((𝐹𝐵) = ∅, 𝐴, if(Lim dom (𝐹𝐵), ran (𝐹𝐵), (𝐻‘((𝐹𝐵)‘ dom (𝐹𝐵))))) ∈ V)
45 eqeq1 2741 . . . . . . 7 (𝑥 = (𝐹𝐵) → (𝑥 = ∅ ↔ (𝐹𝐵) = ∅))
46 dmeq 5854 . . . . . . . . 9 (𝑥 = (𝐹𝐵) → dom 𝑥 = dom (𝐹𝐵))
47 limeq 6331 . . . . . . . . 9 (dom 𝑥 = dom (𝐹𝐵) → (Lim dom 𝑥 ↔ Lim dom (𝐹𝐵)))
4846, 47syl 17 . . . . . . . 8 (𝑥 = (𝐹𝐵) → (Lim dom 𝑥 ↔ Lim dom (𝐹𝐵)))
49 rneq 5887 . . . . . . . . 9 (𝑥 = (𝐹𝐵) → ran 𝑥 = ran (𝐹𝐵))
5049unieqd 4864 . . . . . . . 8 (𝑥 = (𝐹𝐵) → ran 𝑥 = ran (𝐹𝐵))
51 fveq1 6835 . . . . . . . . . 10 (𝑥 = (𝐹𝐵) → (𝑥 dom 𝑥) = ((𝐹𝐵)‘ dom 𝑥))
5246unieqd 4864 . . . . . . . . . . 11 (𝑥 = (𝐹𝐵) → dom 𝑥 = dom (𝐹𝐵))
5352fveq2d 6840 . . . . . . . . . 10 (𝑥 = (𝐹𝐵) → ((𝐹𝐵)‘ dom 𝑥) = ((𝐹𝐵)‘ dom (𝐹𝐵)))
5451, 53eqtrd 2772 . . . . . . . . 9 (𝑥 = (𝐹𝐵) → (𝑥 dom 𝑥) = ((𝐹𝐵)‘ dom (𝐹𝐵)))
5554fveq2d 6840 . . . . . . . 8 (𝑥 = (𝐹𝐵) → (𝐻‘(𝑥 dom 𝑥)) = (𝐻‘((𝐹𝐵)‘ dom (𝐹𝐵))))
5648, 50, 55ifbieq12d 4496 . . . . . . 7 (𝑥 = (𝐹𝐵) → if(Lim dom 𝑥, ran 𝑥, (𝐻‘(𝑥 dom 𝑥))) = if(Lim dom (𝐹𝐵), ran (𝐹𝐵), (𝐻‘((𝐹𝐵)‘ dom (𝐹𝐵)))))
5745, 56ifbieq2d 4494 . . . . . 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 𝑥)))))
5957, 58fvmptg 6941 . . . . 5 (((𝐹𝐵) ∈ V ∧ if((𝐹𝐵) = ∅, 𝐴, if(Lim dom (𝐹𝐵), ran (𝐹𝐵), (𝐻‘((𝐹𝐵)‘ dom (𝐹𝐵))))) ∈ V) → (𝐺‘(𝐹𝐵)) = if((𝐹𝐵) = ∅, 𝐴, if(Lim dom (𝐹𝐵), ran (𝐹𝐵), (𝐻‘((𝐹𝐵)‘ dom (𝐹𝐵))))))
6011, 44, 59syl2anc 585 . . . 4 ((𝐵𝑋 ∧ Lim 𝐵) → (𝐺‘(𝐹𝐵)) = if((𝐹𝐵) = ∅, 𝐴, if(Lim dom (𝐹𝐵), ran (𝐹𝐵), (𝐻‘((𝐹𝐵)‘ dom (𝐹𝐵))))))
6160, 40eqtrd 2772 . . 3 ((𝐵𝑋 ∧ Lim 𝐵) → (𝐺‘(𝐹𝐵)) = ran (𝐹𝐵))
627, 61eqtrd 2772 . 2 ((𝐵𝑋 ∧ Lim 𝐵) → (𝐹𝐵) = ran (𝐹𝐵))
63 df-ima 5639 . . 3 (𝐹𝐵) = ran (𝐹𝐵)
6463unieqi 4863 . 2 (𝐹𝐵) = ran (𝐹𝐵)
6562, 64eqtr4di 2790 1 ((𝐵𝑋 ∧ Lim 𝐵) → (𝐹𝐵) = (𝐹𝐵))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  Vcvv 3430  cin 3889  wss 3890  c0 4274  ifcif 4467   cuni 4851  cmpt 5167  dom cdm 5626  ran crn 5627  cres 5628  cima 5629  Ord word 6318  Lim wlim 6320   Fn wfn 6489  cfv 6494
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5232  ax-pr 5372  ax-un 7684
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5521  df-eprel 5526  df-po 5534  df-so 5535  df-fr 5579  df-we 5581  df-xp 5632  df-rel 5633  df-cnv 5634  df-co 5635  df-dm 5636  df-rn 5637  df-res 5638  df-ima 5639  df-ord 6322  df-lim 6324  df-iota 6450  df-fun 6496  df-fn 6497  df-fv 6502
This theorem is referenced by:  rdglimg  8359
  Copyright terms: Public domain W3C validator