Theorem madeval 28105

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 28100	. . 3 ⊢ M = recs((𝑥 ∈ V ↦ ( |s “ (𝒫 ∪ ran 𝑥 × 𝒫 ∪ ran 𝑥))))
2	1	tfr2 8391	. 2 ⊢ (𝐴 ∈ On → ( M ‘𝐴) = ((𝑥 ∈ V ↦ ( |s “ (𝒫 ∪ ran 𝑥 × 𝒫 ∪ ran 𝑥)))‘( M ↾ 𝐴)))
3		eqid 2762	. . 3 ⊢ (𝑥 ∈ V ↦ ( |s “ (𝒫 ∪ ran 𝑥 × 𝒫 ∪ ran 𝑥))) = (𝑥 ∈ V ↦ ( |s “ (𝒫 ∪ ran 𝑥 × 𝒫 ∪ ran 𝑥)))
4		rneq 5924	. . . . . . . 8 ⊢ (𝑥 = ( M ↾ 𝐴) → ran 𝑥 = ran ( M ↾ 𝐴))
5		df-ima 5672	. . . . . . . 8 ⊢ ( M “ 𝐴) = ran ( M ↾ 𝐴)
6	4, 5	eqtr4di 2815	. . . . . . 7 ⊢ (𝑥 = ( M ↾ 𝐴) → ran 𝑥 = ( M “ 𝐴))
7	6	unieqd 4883	. . . . . 6 ⊢ (𝑥 = ( M ↾ 𝐴) → ∪ ran 𝑥 = ∪ ( M “ 𝐴))
8	7	pweqd 4577	. . . . 5 ⊢ (𝑥 = ( M ↾ 𝐴) → 𝒫 ∪ ran 𝑥 = 𝒫 ∪ ( M “ 𝐴))
9	8	sqxpeqd 5691	. . . 4 ⊢ (𝑥 = ( M ↾ 𝐴) → (𝒫 ∪ ran 𝑥 × 𝒫 ∪ ran 𝑥) = (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴)))
10	9	imaeq2d 6060	. . 3 ⊢ (𝑥 = ( M ↾ 𝐴) → ( |s “ (𝒫 ∪ ran 𝑥 × 𝒫 ∪ ran 𝑥)) = ( |s “ (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴))))
11	1	tfr1 8390	. . . . 5 ⊢ M Fn On
12		fnfun 6636	. . . . 5 ⊢ ( M Fn On → Fun M )
13	11, 12	ax-mp 5	. . . 4 ⊢ Fun M
14		resfunexg 7218	. . . 4 ⊢ ((Fun M ∧ 𝐴 ∈ On) → ( M ↾ 𝐴) ∈ V)
15	13, 14	mpan 703	. . 3 ⊢ (𝐴 ∈ On → ( M ↾ 𝐴) ∈ V)
16		cutsf 28065	. . . . 5 ⊢ |s : <<s ⟶ No
17		ffun 6709	. . . . 5 ⊢ ( |s : <<s ⟶ No → Fun |s )
18	16, 17	ax-mp 5	. . . 4 ⊢ Fun |s
19		funimaexg 6623	. . . . . . 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 5347	. . . . . 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 6623	. . . 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 7014	. 2 ⊢ (𝐴 ∈ On → ((𝑥 ∈ V ↦ ( |s “ (𝒫 ∪ ran 𝑥 × 𝒫 ∪ ran 𝑥)))‘( M ↾ 𝐴)) = ( |s “ (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴))))
28	2, 27	eqtrd 2797	1 ⊢ (𝐴 ∈ On → ( M ‘𝐴) = ( |s “ (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴))))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  Vcvv 3453  𝒫 cpw 4560  ∪ cuni 4870   ↦ cmpt 5190   × cxp 5657  ran crn 5660   ↾ cres 5661   “ cima 5662  Oncon0 6361  Fun wfun 6531   Fn wfn 6532  ⟶wf 6533  ‘cfv 6537   No csur 27884   <<s cslts 28030   |s ccuts 28032   M cmade 28095

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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-tp 4592  df-op 4594  df-uni 4871  df-int 4911  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7374  df-ov 7420  df-oprab 7421  df-mpo 7422  df-2nd 7991  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-1o 8459  df-2o 8460  df-no 27887  df-lts 27888  df-bday 27889  df-slts 28031  df-cuts 28033  df-made 28100

This theorem is used by:  madeval2  28106  madefi  28186