Theorem elold 27867

Description: Membership in an old set. (Contributed by Scott Fenton, 7-Aug-2024.)

Assertion

Ref	Expression
elold	⊢ (𝐴 ∈ On → (𝑋 ∈ ( O ‘𝐴) ↔ ∃𝑏 ∈ 𝐴 𝑋 ∈ ( M ‘𝑏)))

Distinct variable groups:   𝐴,𝑏   𝑋,𝑏

Proof of Theorem elold

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		oldval 27842	. . 3 ⊢ (𝐴 ∈ On → ( O ‘𝐴) = ∪ ( M “ 𝐴))
2	1	eleq2d 2823	. 2 ⊢ (𝐴 ∈ On → (𝑋 ∈ ( O ‘𝐴) ↔ 𝑋 ∈ ∪ ( M “ 𝐴)))
3		eluni 4868	. . 3 ⊢ (𝑋 ∈ ∪ ( M “ 𝐴) ↔ ∃𝑦(𝑋 ∈ 𝑦 ∧ 𝑦 ∈ ( M “ 𝐴)))
4		madef 27844	. . . . . . . 8 ⊢ M :On⟶𝒫 No
5		ffn 6670	. . . . . . . 8 ⊢ ( M :On⟶𝒫 No → M Fn On)
6	4, 5	ax-mp 5	. . . . . . 7 ⊢ M Fn On
7		onss 7740	. . . . . . 7 ⊢ (𝐴 ∈ On → 𝐴 ⊆ On)
8		fvelimab 6914	. . . . . . 7 ⊢ (( M Fn On ∧ 𝐴 ⊆ On) → (𝑦 ∈ ( M “ 𝐴) ↔ ∃𝑏 ∈ 𝐴 ( M ‘𝑏) = 𝑦))
9	6, 7, 8	sylancr 588	. . . . . 6 ⊢ (𝐴 ∈ On → (𝑦 ∈ ( M “ 𝐴) ↔ ∃𝑏 ∈ 𝐴 ( M ‘𝑏) = 𝑦))
10	9	anbi2d 631	. . . . 5 ⊢ (𝐴 ∈ On → ((𝑋 ∈ 𝑦 ∧ 𝑦 ∈ ( M “ 𝐴)) ↔ (𝑋 ∈ 𝑦 ∧ ∃𝑏 ∈ 𝐴 ( M ‘𝑏) = 𝑦)))
11	10	exbidv 1923	. . . 4 ⊢ (𝐴 ∈ On → (∃𝑦(𝑋 ∈ 𝑦 ∧ 𝑦 ∈ ( M “ 𝐴)) ↔ ∃𝑦(𝑋 ∈ 𝑦 ∧ ∃𝑏 ∈ 𝐴 ( M ‘𝑏) = 𝑦)))
12		fvex 6855	. . . . . . 7 ⊢ ( M ‘𝑏) ∈ V
13	12	clel3 3618	. . . . . 6 ⊢ (𝑋 ∈ ( M ‘𝑏) ↔ ∃𝑦(𝑦 = ( M ‘𝑏) ∧ 𝑋 ∈ 𝑦))
14	13	rexbii 3085	. . . . 5 ⊢ (∃𝑏 ∈ 𝐴 𝑋 ∈ ( M ‘𝑏) ↔ ∃𝑏 ∈ 𝐴 ∃𝑦(𝑦 = ( M ‘𝑏) ∧ 𝑋 ∈ 𝑦))
15		rexcom4 3265	. . . . 5 ⊢ (∃𝑏 ∈ 𝐴 ∃𝑦(𝑦 = ( M ‘𝑏) ∧ 𝑋 ∈ 𝑦) ↔ ∃𝑦∃𝑏 ∈ 𝐴 (𝑦 = ( M ‘𝑏) ∧ 𝑋 ∈ 𝑦))
16		eqcom 2744	. . . . . . . . 9 ⊢ (𝑦 = ( M ‘𝑏) ↔ ( M ‘𝑏) = 𝑦)
17	16	anbi2ci 626	. . . . . . . 8 ⊢ ((𝑦 = ( M ‘𝑏) ∧ 𝑋 ∈ 𝑦) ↔ (𝑋 ∈ 𝑦 ∧ ( M ‘𝑏) = 𝑦))
18	17	rexbii 3085	. . . . . . 7 ⊢ (∃𝑏 ∈ 𝐴 (𝑦 = ( M ‘𝑏) ∧ 𝑋 ∈ 𝑦) ↔ ∃𝑏 ∈ 𝐴 (𝑋 ∈ 𝑦 ∧ ( M ‘𝑏) = 𝑦))
19		r19.42v 3170	. . . . . . 7 ⊢ (∃𝑏 ∈ 𝐴 (𝑋 ∈ 𝑦 ∧ ( M ‘𝑏) = 𝑦) ↔ (𝑋 ∈ 𝑦 ∧ ∃𝑏 ∈ 𝐴 ( M ‘𝑏) = 𝑦))
20	18, 19	bitri 275	. . . . . 6 ⊢ (∃𝑏 ∈ 𝐴 (𝑦 = ( M ‘𝑏) ∧ 𝑋 ∈ 𝑦) ↔ (𝑋 ∈ 𝑦 ∧ ∃𝑏 ∈ 𝐴 ( M ‘𝑏) = 𝑦))
21	20	exbii 1850	. . . . 5 ⊢ (∃𝑦∃𝑏 ∈ 𝐴 (𝑦 = ( M ‘𝑏) ∧ 𝑋 ∈ 𝑦) ↔ ∃𝑦(𝑋 ∈ 𝑦 ∧ ∃𝑏 ∈ 𝐴 ( M ‘𝑏) = 𝑦))
22	14, 15, 21	3bitrri 298	. . . 4 ⊢ (∃𝑦(𝑋 ∈ 𝑦 ∧ ∃𝑏 ∈ 𝐴 ( M ‘𝑏) = 𝑦) ↔ ∃𝑏 ∈ 𝐴 𝑋 ∈ ( M ‘𝑏))
23	11, 22	bitrdi 287	. . 3 ⊢ (𝐴 ∈ On → (∃𝑦(𝑋 ∈ 𝑦 ∧ 𝑦 ∈ ( M “ 𝐴)) ↔ ∃𝑏 ∈ 𝐴 𝑋 ∈ ( M ‘𝑏)))
24	3, 23	bitrid 283	. 2 ⊢ (𝐴 ∈ On → (𝑋 ∈ ∪ ( M “ 𝐴) ↔ ∃𝑏 ∈ 𝐴 𝑋 ∈ ( M ‘𝑏)))
25	2, 24	bitrd 279	1 ⊢ (𝐴 ∈ On → (𝑋 ∈ ( O ‘𝐴) ↔ ∃𝑏 ∈ 𝐴 𝑋 ∈ ( M ‘𝑏)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542  ∃wex 1781   ∈ wcel 2114  ∃wrex 3062   ⊆ wss 3903  𝒫 cpw 4556  ∪ cuni 4865   “ cima 5635  Oncon0 6325   Fn wfn 6495  ⟶wf 6496  ‘cfv 6500   No csur 27619   M cmade 27830   O cold 27831

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-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690

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-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-tp 4587  df-op 4589  df-uni 4866  df-int 4905  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-1o 8407  df-2o 8408  df-no 27622  df-lts 27623  df-bday 27624  df-slts 27766  df-cuts 27768  df-made 27835  df-old 27836

This theorem is referenced by:  oldssmade  27875  oldlim  27895  madebdayim  27896  oldbdayim  27897  madebdaylemold  27906