Theorem madeval 28200

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 28195	. . 3 ⊢ M = recs((𝑥 ∈ V ↦ ( |s “ (𝒫 ∪ ran 𝑥 × 𝒫 ∪ ran 𝑥))))
2	1	tfr2 8390	. 2 ⊢ (𝐴 ∈ On → ( M ‘𝐴) = ((𝑥 ∈ V ↦ ( |s “ (𝒫 ∪ ran 𝑥 × 𝒫 ∪ ran 𝑥)))‘( M ↾ 𝐴)))
3		eqid 2761	. . 3 ⊢ (𝑥 ∈ V ↦ ( |s “ (𝒫 ∪ ran 𝑥 × 𝒫 ∪ ran 𝑥))) = (𝑥 ∈ V ↦ ( |s “ (𝒫 ∪ ran 𝑥 × 𝒫 ∪ ran 𝑥)))
4		rneq 5918	. . . . . . . 8 ⊢ (𝑥 = ( M ↾ 𝐴) → ran 𝑥 = ran ( M ↾ 𝐴))
5		df-ima 5664	. . . . . . . 8 ⊢ ( M “ 𝐴) = ran ( M ↾ 𝐴)
6	4, 5	eqtr4di 2814	. . . . . . 7 ⊢ (𝑥 = ( M ↾ 𝐴) → ran 𝑥 = ( M “ 𝐴))
7	6	unieqd 4880	. . . . . 6 ⊢ (𝑥 = ( M ↾ 𝐴) → ∪ ran 𝑥 = ∪ ( M “ 𝐴))
8	7	pweqd 4574	. . . . 5 ⊢ (𝑥 = ( M ↾ 𝐴) → 𝒫 ∪ ran 𝑥 = 𝒫 ∪ ( M “ 𝐴))
9	8	sqxpeqd 5683	. . . 4 ⊢ (𝑥 = ( M ↾ 𝐴) → (𝒫 ∪ ran 𝑥 × 𝒫 ∪ ran 𝑥) = (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴)))
10	9	imaeq2d 6054	. . 3 ⊢ (𝑥 = ( M ↾ 𝐴) → ( |s “ (𝒫 ∪ ran 𝑥 × 𝒫 ∪ ran 𝑥)) = ( |s “ (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴))))
11	1	tfr1 8389	. . . . 5 ⊢ M Fn On
12		fnfun 6631	. . . . 5 ⊢ ( M Fn On → Fun M )
13	11, 12	ax-mp 5	. . . 4 ⊢ Fun M
14		resfunexg 7213	. . . 4 ⊢ ((Fun M ∧ 𝐴 ∈ On) → ( M ↾ 𝐴) ∈ V)
15	13, 14	mpan 703	. . 3 ⊢ (𝐴 ∈ On → ( M ↾ 𝐴) ∈ V)
16		cutsf 28160	. . . . 5 ⊢ |s : <<s ⟶ No
17		ffun 6704	. . . . 5 ⊢ ( |s : <<s ⟶ No → Fun |s )
18	16, 17	ax-mp 5	. . . 4 ⊢ Fun |s
19		funimaexg 6618	. . . . . . 7 ⊢ ((Fun M ∧ 𝐴 ∈ On) → ( M “ 𝐴) ∈ V)
20	13, 19	mpan 703	. . . . . 6 ⊢ (𝐴 ∈ On → ( M “ 𝐴) ∈ V)
21		uniexg 7746	. . . . . 6 ⊢ (( M “ 𝐴) ∈ V → ∪ ( M “ 𝐴) ∈ V)
22		pwexg 5340	. . . . . 6 ⊢ (∪ ( M “ 𝐴) ∈ V → 𝒫 ∪ ( M “ 𝐴) ∈ V)
23	20, 21, 22	3syl 19	. . . . 5 ⊢ (𝐴 ∈ On → 𝒫 ∪ ( M “ 𝐴) ∈ V)
24	23, 23	xpexd 7754	. . . 4 ⊢ (𝐴 ∈ On → (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴)) ∈ V)
25		funimaexg 6618	. . . 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 7009	. 2 ⊢ (𝐴 ∈ On → ((𝑥 ∈ V ↦ ( |s “ (𝒫 ∪ ran 𝑥 × 𝒫 ∪ ran 𝑥)))‘( M ↾ 𝐴)) = ( |s “ (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴))))
28	2, 27	eqtrd 2796	1 ⊢ (𝐴 ∈ On → ( M ‘𝐴) = ( |s “ (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴))))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  Vcvv 3451  𝒫 cpw 4557  ∪ cuni 4867   ↦ cmpt 5186   × cxp 5649  ran crn 5652   ↾ cres 5653   “ cima 5654  Oncon0 6355  Fun wfun 6525   Fn wfn 6526  ⟶wf 6527  ‘cfv 6531   No csur 27979   <<s cslts 28125   |s ccuts 28127   M cmade 28190

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297  df-ord 6358  df-on 6359  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-2nd 7991  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-1o 8460  df-2o 8461  df-no 27982  df-lts 27983  df-bday 27984  df-slts 28126  df-cuts 28128  df-made 28195

This theorem is used by:  madeval2  28201  madefi  28281