Theorem madeval2 28201

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

Assertion

Ref	Expression
madeval2	⊢ (𝐴 ∈ On → ( M ‘𝐴) = {𝑥 ∈ No ∣ ∃𝑎 ∈ 𝒫 ∪ ( M “ 𝐴)∃𝑏 ∈ 𝒫 ∪ ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥)})

Distinct variable group:   𝑥,𝐴,𝑎,𝑏

Proof of Theorem madeval2

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		madeval 28200	. 2 ⊢ (𝐴 ∈ On → ( M ‘𝐴) = ( |s “ (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴))))
2		cutscl 28150	. . . . . . . 8 ⊢ (𝑎 <<s 𝑏 → (𝑎 |s 𝑏) ∈ No )
3		eleq1 2849	. . . . . . . . 9 ⊢ ((𝑎 |s 𝑏) = 𝑥 → ((𝑎 |s 𝑏) ∈ No ↔ 𝑥 ∈ No ))
4	3	biimpd 232	. . . . . . . 8 ⊢ ((𝑎 |s 𝑏) = 𝑥 → ((𝑎 |s 𝑏) ∈ No → 𝑥 ∈ No ))
5	2, 4	mpan9 516	. . . . . . 7 ⊢ ((𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥) → 𝑥 ∈ No )
6	5	rexlimivw 3160	. . . . . 6 ⊢ (∃𝑏 ∈ 𝒫 ∪ ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥) → 𝑥 ∈ No )
7	6	rexlimivw 3160	. . . . 5 ⊢ (∃𝑎 ∈ 𝒫 ∪ ( M “ 𝐴)∃𝑏 ∈ 𝒫 ∪ ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥) → 𝑥 ∈ No )
8	7	pm4.71ri 570	. . . 4 ⊢ (∃𝑎 ∈ 𝒫 ∪ ( M “ 𝐴)∃𝑏 ∈ 𝒫 ∪ ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥) ↔ (𝑥 ∈ No ∧ ∃𝑎 ∈ 𝒫 ∪ ( M “ 𝐴)∃𝑏 ∈ 𝒫 ∪ ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥)))
9	8	abbii 2828	. . 3 ⊢ {𝑥 ∣ ∃𝑎 ∈ 𝒫 ∪ ( M “ 𝐴)∃𝑏 ∈ 𝒫 ∪ ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥)} = {𝑥 ∣ (𝑥 ∈ No ∧ ∃𝑎 ∈ 𝒫 ∪ ( M “ 𝐴)∃𝑏 ∈ 𝒫 ∪ ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥))}
10		eleq1 2849	. . . . . . 7 ⊢ (𝑦 = ⟨𝑎, 𝑏⟩ → (𝑦 ∈ <<s ↔ ⟨𝑎, 𝑏⟩ ∈ <<s ))
11		breq1 5106	. . . . . . 7 ⊢ (𝑦 = ⟨𝑎, 𝑏⟩ → (𝑦 |s 𝑥 ↔ ⟨𝑎, 𝑏⟩ |s 𝑥))
12	10, 11	anbi12d 644	. . . . . 6 ⊢ (𝑦 = ⟨𝑎, 𝑏⟩ → ((𝑦 ∈ <<s ∧ 𝑦 |s 𝑥) ↔ (⟨𝑎, 𝑏⟩ ∈ <<s ∧ ⟨𝑎, 𝑏⟩ |s 𝑥)))
13	12	rexxp 5819	. . . . 5 ⊢ (∃𝑦 ∈ (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴))(𝑦 ∈ <<s ∧ 𝑦 |s 𝑥) ↔ ∃𝑎 ∈ 𝒫 ∪ ( M “ 𝐴)∃𝑏 ∈ 𝒫 ∪ ( M “ 𝐴)(⟨𝑎, 𝑏⟩ ∈ <<s ∧ ⟨𝑎, 𝑏⟩ |s 𝑥))
14		imaindm 6295	. . . . . . . 8 ⊢ ( |s “ (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴))) = ( |s “ ((𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴)) ∩ dom |s ))
15		dmcuts 28159	. . . . . . . . . 10 ⊢ dom |s = <<s
16	15	ineq2i 4163	. . . . . . . . 9 ⊢ ((𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴)) ∩ dom |s ) = ((𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴)) ∩ <<s )
17	16	imaeq2i 6052	. . . . . . . 8 ⊢ ( |s “ ((𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴)) ∩ dom |s )) = ( |s “ ((𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴)) ∩ <<s ))
18	14, 17	eqtri 2784	. . . . . . 7 ⊢ ( |s “ (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴))) = ( |s “ ((𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴)) ∩ <<s ))
19	18	eleq2i 2853	. . . . . 6 ⊢ (𝑥 ∈ ( |s “ (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴))) ↔ 𝑥 ∈ ( |s “ ((𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴)) ∩ <<s )))
20		vex 3455	. . . . . . 7 ⊢ 𝑥 ∈ V
21	20	elima 6059	. . . . . 6 ⊢ (𝑥 ∈ ( |s “ ((𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴)) ∩ <<s )) ↔ ∃𝑦 ∈ ((𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴)) ∩ <<s )𝑦 |s 𝑥)
22		elin 3915	. . . . . . . . 9 ⊢ (𝑦 ∈ ((𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴)) ∩ <<s ) ↔ (𝑦 ∈ (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴)) ∧ 𝑦 ∈ <<s ))
23	22	anbi1i 636	. . . . . . . 8 ⊢ ((𝑦 ∈ ((𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴)) ∩ <<s ) ∧ 𝑦 |s 𝑥) ↔ ((𝑦 ∈ (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴)) ∧ 𝑦 ∈ <<s ) ∧ 𝑦 |s 𝑥))
24		anass 474	. . . . . . . 8 ⊢ (((𝑦 ∈ (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴)) ∧ 𝑦 ∈ <<s ) ∧ 𝑦 |s 𝑥) ↔ (𝑦 ∈ (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴)) ∧ (𝑦 ∈ <<s ∧ 𝑦 |s 𝑥)))
25	23, 24	bitri 278	. . . . . . 7 ⊢ ((𝑦 ∈ ((𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴)) ∩ <<s ) ∧ 𝑦 |s 𝑥) ↔ (𝑦 ∈ (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴)) ∧ (𝑦 ∈ <<s ∧ 𝑦 |s 𝑥)))
26	25	rexbii2 3106	. . . . . 6 ⊢ (∃𝑦 ∈ ((𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴)) ∩ <<s )𝑦 |s 𝑥 ↔ ∃𝑦 ∈ (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴))(𝑦 ∈ <<s ∧ 𝑦 |s 𝑥))
27	19, 21, 26	3bitri 300	. . . . 5 ⊢ (𝑥 ∈ ( |s “ (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴))) ↔ ∃𝑦 ∈ (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴))(𝑦 ∈ <<s ∧ 𝑦 |s 𝑥))
28		df-br 5104	. . . . . . . 8 ⊢ (𝑎 <<s 𝑏 ↔ ⟨𝑎, 𝑏⟩ ∈ <<s )
29	28	anbi1i 636	. . . . . . 7 ⊢ ((𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥) ↔ (⟨𝑎, 𝑏⟩ ∈ <<s ∧ (𝑎 |s 𝑏) = 𝑥))
30		df-ov 7415	. . . . . . . . . 10 ⊢ (𝑎 |s 𝑏) = ( |s ‘⟨𝑎, 𝑏⟩)
31	30	eqeq1i 2766	. . . . . . . . 9 ⊢ ((𝑎 |s 𝑏) = 𝑥 ↔ ( |s ‘⟨𝑎, 𝑏⟩) = 𝑥)
32		cutsf 28160	. . . . . . . . . . 11 ⊢ |s : <<s ⟶ No
33		ffn 6701	. . . . . . . . . . 11 ⊢ ( |s : <<s ⟶ No → |s Fn <<s )
34	32, 33	ax-mp 5	. . . . . . . . . 10 ⊢ |s Fn <<s
35		fnbrfvb 6927	. . . . . . . . . 10 ⊢ (( |s Fn <<s ∧ ⟨𝑎, 𝑏⟩ ∈ <<s ) → (( |s ‘⟨𝑎, 𝑏⟩) = 𝑥 ↔ ⟨𝑎, 𝑏⟩ |s 𝑥))
36	34, 35	mpan 703	. . . . . . . . 9 ⊢ (⟨𝑎, 𝑏⟩ ∈ <<s → (( |s ‘⟨𝑎, 𝑏⟩) = 𝑥 ↔ ⟨𝑎, 𝑏⟩ |s 𝑥))
37	31, 36	bitrid 286	. . . . . . . 8 ⊢ (⟨𝑎, 𝑏⟩ ∈ <<s → ((𝑎 |s 𝑏) = 𝑥 ↔ ⟨𝑎, 𝑏⟩ |s 𝑥))
38	37	pm5.32i 585	. . . . . . 7 ⊢ ((⟨𝑎, 𝑏⟩ ∈ <<s ∧ (𝑎 |s 𝑏) = 𝑥) ↔ (⟨𝑎, 𝑏⟩ ∈ <<s ∧ ⟨𝑎, 𝑏⟩ |s 𝑥))
39	29, 38	bitri 278	. . . . . 6 ⊢ ((𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥) ↔ (⟨𝑎, 𝑏⟩ ∈ <<s ∧ ⟨𝑎, 𝑏⟩ |s 𝑥))
40	39	2rexbii 3139	. . . . 5 ⊢ (∃𝑎 ∈ 𝒫 ∪ ( M “ 𝐴)∃𝑏 ∈ 𝒫 ∪ ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥) ↔ ∃𝑎 ∈ 𝒫 ∪ ( M “ 𝐴)∃𝑏 ∈ 𝒫 ∪ ( M “ 𝐴)(⟨𝑎, 𝑏⟩ ∈ <<s ∧ ⟨𝑎, 𝑏⟩ |s 𝑥))
41	13, 27, 40	3bitr4i 306	. . . 4 ⊢ (𝑥 ∈ ( |s “ (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴))) ↔ ∃𝑎 ∈ 𝒫 ∪ ( M “ 𝐴)∃𝑏 ∈ 𝒫 ∪ ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥))
42	41	eqabi 2896	. . 3 ⊢ ( |s “ (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴))) = {𝑥 ∣ ∃𝑎 ∈ 𝒫 ∪ ( M “ 𝐴)∃𝑏 ∈ 𝒫 ∪ ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥)}
43		df-rab 3414	. . 3 ⊢ {𝑥 ∈ No ∣ ∃𝑎 ∈ 𝒫 ∪ ( M “ 𝐴)∃𝑏 ∈ 𝒫 ∪ ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥)} = {𝑥 ∣ (𝑥 ∈ No ∧ ∃𝑎 ∈ 𝒫 ∪ ( M “ 𝐴)∃𝑏 ∈ 𝒫 ∪ ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥))}
44	9, 42, 43	3eqtr4i 2794	. 2 ⊢ ( |s “ (𝒫 ∪ ( M “ 𝐴) × 𝒫 ∪ ( M “ 𝐴))) = {𝑥 ∈ No ∣ ∃𝑎 ∈ 𝒫 ∪ ( M “ 𝐴)∃𝑏 ∈ 𝒫 ∪ ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥)}
45	1, 44	eqtrdi 2812	1 ⊢ (𝐴 ∈ On → ( M ‘𝐴) = {𝑥 ∈ No ∣ ∃𝑎 ∈ 𝒫 ∪ ( M “ 𝐴)∃𝑏 ∈ 𝒫 ∪ ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥)})

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {cab 2739  ∃wrex 3087  {crab 3413   ∩ cin 3898  𝒫 cpw 4557  ⟨cop 4590  ∪ cuni 4867   class class class wbr 5103   × cxp 5649  dom cdm 5651   “ cima 5654  Oncon0 6355   Fn wfn 6526  ⟶wf 6527  ‘cfv 6531  (class class class)co 7412   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:  madef  28204  elmade  28225  made0  28231  madess  28234