Theorem madeval 28062

Description: The value of the made by function. (Contributed by Scott Fenton, 17-Dec-2021.)

Assertion

Ref	Expression
madeval	⊢ (𝐴 ∈ On → ( M ‘𝐴) = ( |s “ (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴))))

Proof of Theorem madeval

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-made 28057	. . 3 ⊢ M = recs((𝑥 ∈ V ↦ ( |s “ (𝒫 ∪ ran 𝑥 × 𝒫 ∪ ran 𝑥))))
2	1	tfr2 8394	. 2 ⊢ (𝐴 ∈ On → ( M ‘𝐴) = ((𝑥 ∈ V ↦ ( |s “ (𝒫 ∪ ran 𝑥 × 𝒫 ∪ ran 𝑥)))‘( M ↾ 𝐴)))
3		eqid 2766	. . 3 ⊢ (𝑥 ∈ V ↦ ( |s “ (𝒫 ∪ ran 𝑥 × 𝒫 ∪ ran 𝑥))) = (𝑥 ∈ V ↦ ( |s “ (𝒫 ∪ ran 𝑥 × 𝒫 ∪ ran 𝑥)))
4		rneq 5931	. . . . . . . 8 ⊢ (𝑥 = ( M ↾ 𝐴) → ran 𝑥 = ran ( M ↾ 𝐴))
5		df-ima 5679	. . . . . . . 8 ⊢ ( M “ 𝐴) = ran ( M ↾ 𝐴)
6	4, 5	eqtr4di 2819	. . . . . . 7 ⊢ (𝑥 = ( M ↾ 𝐴) → ran 𝑥 = ( M “ 𝐴))
7	6	unieqd 4890	. . . . . 6 ⊢ (𝑥 = ( M ↾ 𝐴) → ∪ ran 𝑥 = ∪ ( M “ 𝐴))
8	7	pweqd 4584	. . . . 5 ⊢ (𝑥 = ( M ↾ 𝐴) → 𝒫 ∪ ran 𝑥 = 𝒫 ∪ ( M “ 𝐴))
9	8	sqxpeqd 5698	. . . 4 ⊢ (𝑥 = ( M ↾ 𝐴) → (𝒫 ∪ ran 𝑥 × 𝒫 ∪ ran 𝑥) = (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴)))
10	9	imaeq2d 6067	. . 3 ⊢ (𝑥 = ( M ↾ 𝐴) → ( |s “ (𝒫 ∪ ran 𝑥 × 𝒫 ∪ ran 𝑥)) = ( |s “ (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴))))
11	1	tfr1 8393	. . . . 5 ⊢ M Fn On
12		fnfun 6642	. . . . 5 ⊢ ( M Fn On → Fun M )
13	11, 12	ax-mp 5	. . . 4 ⊢ Fun M
14		resfunexg 7220	. . . 4 ⊢ ((Fun M ∧ 𝐴 ∈ On) → ( M ↾ 𝐴) ∈ V)
15	13, 14	mpan 703	. . 3 ⊢ (𝐴 ∈ On → ( M ↾ 𝐴) ∈ V)
16		cutsf 28022	. . . . 5 ⊢ |s : <<s ⟶ No
17		ffun 6715	. . . . 5 ⊢ ( |s : <<s ⟶ No → Fun |s )
18	16, 17	ax-mp 5	. . . 4 ⊢ Fun |s
19		funimaexg 6629	. . . . . . 7 ⊢ ((Fun M ∧ 𝐴 ∈ On) → ( M “ 𝐴) ∈ V)
20	13, 19	mpan 703	. . . . . 6 ⊢ (𝐴 ∈ On → ( M “ 𝐴) ∈ V)
21		uniexg 7751	. . . . . 6 ⊢ (( M “ 𝐴) ∈ V → ∪ ( M “ 𝐴) ∈ V)
22		pwexg 5354	. . . . . 6 ⊢ (∪ ( M “ 𝐴) ∈ V → 𝒫 ∪ ( M “ 𝐴) ∈ V)
23	20, 21, 22	3syl 19	. . . . 5 ⊢ (𝐴 ∈ On → 𝒫 ∪ ( M “ 𝐴) ∈ V)
24	23, 23	xpexd 7759	. . . 4 ⊢ (𝐴 ∈ On → (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴)) ∈ V)
25		funimaexg 6629	. . . 4 ⊢ ((Fun |s ∧ (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴)) ∈ V) → ( |s “ (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴))) ∈ V)
26	18, 24, 25	sylancr 599	. . 3 ⊢ (𝐴 ∈ On → ( |s “ (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴))) ∈ V)
27	3, 10, 15, 26	fvmptd3 7020	. 2 ⊢ (𝐴 ∈ On → ((𝑥 ∈ V ↦ ( |s “ (𝒫 ∪ ran 𝑥 × 𝒫 ∪ ran 𝑥)))‘( M ↾ 𝐴)) = ( |s “ (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴))))
28	2, 27	eqtrd 2801	1 ⊢ (𝐴 ∈ On → ( M ‘𝐴) = ( |s “ (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴))))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2146  Vcvv 3458  𝒫 cpw 4567  ∪ cuni 4877   ↦ cmpt 5197   × cxp 5664  ran crn 5667   ↾ cres 5668   “ cima 5669  Oncon0 6367  Fun wfun 6537   Fn wfn 6538  ⟶wf 6539  ‘cfv 6543   No csur 27841   <<s cslts 27987   |s ccuts 27989   M cmade 28052

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745

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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rmo 3372  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3928  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-tp 4599  df-op 4601  df-uni 4878  df-int 4918  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-tr 5224  df-id 5561  df-eprel 5566  df-po 5574  df-so 5575  df-fr 5619  df-we 5621  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-pred 6309  df-ord 6370  df-on 6371  df-suc 6373  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7380  df-ov 7426  df-oprab 7427  df-mpo 7428  df-2nd 7996  df-frecs 8287  df-wrecs 8318  df-recs 8367  df-1o 8462  df-2o 8463  df-no 27844  df-lts 27845  df-bday 27846  df-slts 27988  df-cuts 27990  df-made 28057

This theorem is used by:  madeval2  28063  madefi  28143