Theorem oldlim 33660

Description: The value of the old set at a limit ordinal. (Contributed by Scott Fenton, 8-Aug-2024.)

Assertion

Ref	Expression
oldlim	⊢ ((Lim 𝐴 ∧ 𝐴 ∈ 𝑉) → ( O ‘𝐴) = ∪ ( O “ 𝐴))

Proof of Theorem oldlim

Dummy variables 𝑥 𝑏 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simprl 770	. . . . . . . . 9 ⊢ (((Lim 𝐴 ∧ 𝐴 ∈ 𝑉) ∧ (𝑐 ∈ 𝐴 ∧ 𝑥 ∈ ( M ‘𝑐))) → 𝑐 ∈ 𝐴)
2		limsuc 7569	. . . . . . . . . 10 ⊢ (Lim 𝐴 → (𝑐 ∈ 𝐴 ↔ suc 𝑐 ∈ 𝐴))
3	2	ad2antrr 725	. . . . . . . . 9 ⊢ (((Lim 𝐴 ∧ 𝐴 ∈ 𝑉) ∧ (𝑐 ∈ 𝐴 ∧ 𝑥 ∈ ( M ‘𝑐))) → (𝑐 ∈ 𝐴 ↔ suc 𝑐 ∈ 𝐴))
4	1, 3	mpbid 235	. . . . . . . 8 ⊢ (((Lim 𝐴 ∧ 𝐴 ∈ 𝑉) ∧ (𝑐 ∈ 𝐴 ∧ 𝑥 ∈ ( M ‘𝑐))) → suc 𝑐 ∈ 𝐴)
5		simprr 772	. . . . . . . . 9 ⊢ (((Lim 𝐴 ∧ 𝐴 ∈ 𝑉) ∧ (𝑐 ∈ 𝐴 ∧ 𝑥 ∈ ( M ‘𝑐))) → 𝑥 ∈ ( M ‘𝑐))
6		limord 6233	. . . . . . . . . . . . 13 ⊢ (Lim 𝐴 → Ord 𝐴)
7		elex 3428	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V)
8	6, 7	anim12i 615	. . . . . . . . . . . 12 ⊢ ((Lim 𝐴 ∧ 𝐴 ∈ 𝑉) → (Ord 𝐴 ∧ 𝐴 ∈ V))
9		elon2 6185	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ On ↔ (Ord 𝐴 ∧ 𝐴 ∈ V))
10	8, 9	sylibr 237	. . . . . . . . . . 11 ⊢ ((Lim 𝐴 ∧ 𝐴 ∈ 𝑉) → 𝐴 ∈ On)
11		onelon 6199	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ On ∧ 𝑐 ∈ 𝐴) → 𝑐 ∈ On)
12	10, 1, 11	syl2an2r 684	. . . . . . . . . 10 ⊢ (((Lim 𝐴 ∧ 𝐴 ∈ 𝑉) ∧ (𝑐 ∈ 𝐴 ∧ 𝑥 ∈ ( M ‘𝑐))) → 𝑐 ∈ On)
13		madeoldsuc 33658	. . . . . . . . . 10 ⊢ (𝑐 ∈ On → ( M ‘𝑐) = ( O ‘suc 𝑐))
14	12, 13	syl 17	. . . . . . . . 9 ⊢ (((Lim 𝐴 ∧ 𝐴 ∈ 𝑉) ∧ (𝑐 ∈ 𝐴 ∧ 𝑥 ∈ ( M ‘𝑐))) → ( M ‘𝑐) = ( O ‘suc 𝑐))
15	5, 14	eleqtrd 2854	. . . . . . . 8 ⊢ (((Lim 𝐴 ∧ 𝐴 ∈ 𝑉) ∧ (𝑐 ∈ 𝐴 ∧ 𝑥 ∈ ( M ‘𝑐))) → 𝑥 ∈ ( O ‘suc 𝑐))
16		fveq2 6663	. . . . . . . . . 10 ⊢ (𝑏 = suc 𝑐 → ( O ‘𝑏) = ( O ‘suc 𝑐))
17	16	eleq2d 2837	. . . . . . . . 9 ⊢ (𝑏 = suc 𝑐 → (𝑥 ∈ ( O ‘𝑏) ↔ 𝑥 ∈ ( O ‘suc 𝑐)))
18	17	rspcev 3543	. . . . . . . 8 ⊢ ((suc 𝑐 ∈ 𝐴 ∧ 𝑥 ∈ ( O ‘suc 𝑐)) → ∃𝑏 ∈ 𝐴 𝑥 ∈ ( O ‘𝑏))
19	4, 15, 18	syl2anc 587	. . . . . . 7 ⊢ (((Lim 𝐴 ∧ 𝐴 ∈ 𝑉) ∧ (𝑐 ∈ 𝐴 ∧ 𝑥 ∈ ( M ‘𝑐))) → ∃𝑏 ∈ 𝐴 𝑥 ∈ ( O ‘𝑏))
20	19	expr 460	. . . . . 6 ⊢ (((Lim 𝐴 ∧ 𝐴 ∈ 𝑉) ∧ 𝑐 ∈ 𝐴) → (𝑥 ∈ ( M ‘𝑐) → ∃𝑏 ∈ 𝐴 𝑥 ∈ ( O ‘𝑏)))
21	20	rexlimdva 3208	. . . . 5 ⊢ ((Lim 𝐴 ∧ 𝐴 ∈ 𝑉) → (∃𝑐 ∈ 𝐴 𝑥 ∈ ( M ‘𝑐) → ∃𝑏 ∈ 𝐴 𝑥 ∈ ( O ‘𝑏)))
22		simprl 770	. . . . . . . 8 ⊢ (((Lim 𝐴 ∧ 𝐴 ∈ 𝑉) ∧ (𝑏 ∈ 𝐴 ∧ 𝑥 ∈ ( O ‘𝑏))) → 𝑏 ∈ 𝐴)
23		onelon 6199	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ On ∧ 𝑏 ∈ 𝐴) → 𝑏 ∈ On)
24	10, 22, 23	syl2an2r 684	. . . . . . . . . 10 ⊢ (((Lim 𝐴 ∧ 𝐴 ∈ 𝑉) ∧ (𝑏 ∈ 𝐴 ∧ 𝑥 ∈ ( O ‘𝑏))) → 𝑏 ∈ On)
25		oldssmade 33651	. . . . . . . . . 10 ⊢ (𝑏 ∈ On → ( O ‘𝑏) ⊆ ( M ‘𝑏))
26	24, 25	syl 17	. . . . . . . . 9 ⊢ (((Lim 𝐴 ∧ 𝐴 ∈ 𝑉) ∧ (𝑏 ∈ 𝐴 ∧ 𝑥 ∈ ( O ‘𝑏))) → ( O ‘𝑏) ⊆ ( M ‘𝑏))
27		simprr 772	. . . . . . . . 9 ⊢ (((Lim 𝐴 ∧ 𝐴 ∈ 𝑉) ∧ (𝑏 ∈ 𝐴 ∧ 𝑥 ∈ ( O ‘𝑏))) → 𝑥 ∈ ( O ‘𝑏))
28	26, 27	sseldd 3895	. . . . . . . 8 ⊢ (((Lim 𝐴 ∧ 𝐴 ∈ 𝑉) ∧ (𝑏 ∈ 𝐴 ∧ 𝑥 ∈ ( O ‘𝑏))) → 𝑥 ∈ ( M ‘𝑏))
29		fveq2 6663	. . . . . . . . . 10 ⊢ (𝑐 = 𝑏 → ( M ‘𝑐) = ( M ‘𝑏))
30	29	eleq2d 2837	. . . . . . . . 9 ⊢ (𝑐 = 𝑏 → (𝑥 ∈ ( M ‘𝑐) ↔ 𝑥 ∈ ( M ‘𝑏)))
31	30	rspcev 3543	. . . . . . . 8 ⊢ ((𝑏 ∈ 𝐴 ∧ 𝑥 ∈ ( M ‘𝑏)) → ∃𝑐 ∈ 𝐴 𝑥 ∈ ( M ‘𝑐))
32	22, 28, 31	syl2anc 587	. . . . . . 7 ⊢ (((Lim 𝐴 ∧ 𝐴 ∈ 𝑉) ∧ (𝑏 ∈ 𝐴 ∧ 𝑥 ∈ ( O ‘𝑏))) → ∃𝑐 ∈ 𝐴 𝑥 ∈ ( M ‘𝑐))
33	32	expr 460	. . . . . 6 ⊢ (((Lim 𝐴 ∧ 𝐴 ∈ 𝑉) ∧ 𝑏 ∈ 𝐴) → (𝑥 ∈ ( O ‘𝑏) → ∃𝑐 ∈ 𝐴 𝑥 ∈ ( M ‘𝑐)))
34	33	rexlimdva 3208	. . . . 5 ⊢ ((Lim 𝐴 ∧ 𝐴 ∈ 𝑉) → (∃𝑏 ∈ 𝐴 𝑥 ∈ ( O ‘𝑏) → ∃𝑐 ∈ 𝐴 𝑥 ∈ ( M ‘𝑐)))
35	21, 34	impbid 215	. . . 4 ⊢ ((Lim 𝐴 ∧ 𝐴 ∈ 𝑉) → (∃𝑐 ∈ 𝐴 𝑥 ∈ ( M ‘𝑐) ↔ ∃𝑏 ∈ 𝐴 𝑥 ∈ ( O ‘𝑏)))
36		elold 33643	. . . . 5 ⊢ (𝐴 ∈ On → (𝑥 ∈ ( O ‘𝐴) ↔ ∃𝑐 ∈ 𝐴 𝑥 ∈ ( M ‘𝑐)))
37	10, 36	syl 17	. . . 4 ⊢ ((Lim 𝐴 ∧ 𝐴 ∈ 𝑉) → (𝑥 ∈ ( O ‘𝐴) ↔ ∃𝑐 ∈ 𝐴 𝑥 ∈ ( M ‘𝑐)))
38		eliun 4890	. . . . 5 ⊢ (𝑥 ∈ ∪ 𝑏 ∈ 𝐴 ( O ‘𝑏) ↔ ∃𝑏 ∈ 𝐴 𝑥 ∈ ( O ‘𝑏))
39	38	a1i 11	. . . 4 ⊢ ((Lim 𝐴 ∧ 𝐴 ∈ 𝑉) → (𝑥 ∈ ∪ 𝑏 ∈ 𝐴 ( O ‘𝑏) ↔ ∃𝑏 ∈ 𝐴 𝑥 ∈ ( O ‘𝑏)))
40	35, 37, 39	3bitr4d 314	. . 3 ⊢ ((Lim 𝐴 ∧ 𝐴 ∈ 𝑉) → (𝑥 ∈ ( O ‘𝐴) ↔ 𝑥 ∈ ∪ 𝑏 ∈ 𝐴 ( O ‘𝑏)))
41	40	eqrdv 2756	. 2 ⊢ ((Lim 𝐴 ∧ 𝐴 ∈ 𝑉) → ( O ‘𝐴) = ∪ 𝑏 ∈ 𝐴 ( O ‘𝑏))
42		oldf 33635	. . 3 ⊢ O :On⟶𝒫 No
43		ffun 6506	. . 3 ⊢ ( O :On⟶𝒫 No → Fun O )
44		funiunfv 7005	. . 3 ⊢ (Fun O → ∪ 𝑏 ∈ 𝐴 ( O ‘𝑏) = ∪ ( O “ 𝐴))
45	42, 43, 44	mp2b 10	. 2 ⊢ ∪ 𝑏 ∈ 𝐴 ( O ‘𝑏) = ∪ ( O “ 𝐴)
46	41, 45	eqtrdi 2809	1 ⊢ ((Lim 𝐴 ∧ 𝐴 ∈ 𝑉) → ( O ‘𝐴) = ∪ ( O “ 𝐴))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2111  ∃wrex 3071  Vcvv 3409   ⊆ wss 3860  𝒫 cpw 4497  ∪ cuni 4801  ∪ ciun 4886   “ cima 5531  Ord word 6173  Oncon0 6174  Lim wlim 6175  suc csuc 6176  Fun wfun 6334  ⟶wf 6336  ‘cfv 6340   No csur 33440   M cmade 33620   O cold 33621

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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2729  ax-rep 5160  ax-sep 5173  ax-nul 5180  ax-pow 5238  ax-pr 5302  ax-un 7465

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-fal 1551  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2557  df-eu 2588  df-clab 2736  df-cleq 2750  df-clel 2830  df-nfc 2901  df-ne 2952  df-ral 3075  df-rex 3076  df-reu 3077  df-rmo 3078  df-rab 3079  df-v 3411  df-sbc 3699  df-csb 3808  df-dif 3863  df-un 3865  df-in 3867  df-ss 3877  df-pss 3879  df-nul 4228  df-if 4424  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4802  df-int 4842  df-iun 4888  df-br 5037  df-opab 5099  df-mpt 5117  df-tr 5143  df-id 5434  df-eprel 5439  df-po 5447  df-so 5448  df-fr 5487  df-we 5489  df-xp 5534  df-rel 5535  df-cnv 5536  df-co 5537  df-dm 5538  df-rn 5539  df-res 5540  df-ima 5541  df-pred 6131  df-ord 6177  df-on 6178  df-lim 6179  df-suc 6180  df-iota 6299  df-fun 6342  df-fn 6343  df-f 6344  df-f1 6345  df-fo 6346  df-f1o 6347  df-fv 6348  df-riota 7114  df-ov 7159  df-oprab 7160  df-mpo 7161  df-wrecs 7963  df-recs 8024  df-1o 8118  df-2o 8119  df-no 33443  df-slt 33444  df-bday 33445  df-sslt 33573  df-scut 33575  df-made 33625  df-old 33626

This theorem is referenced by: (None)