MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  madeval2 Structured version   Visualization version   GIF version

Theorem madeval2 27850
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.
StepHypRef Expression
1 madeval 27849 . 2 (𝐴 ∈ On → ( M ‘𝐴) = ( |s “ (𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴))))
2 cutscl 27799 . . . . . . . 8 (𝑎 <<s 𝑏 → (𝑎 |s 𝑏) ∈ No )
3 eleq1 2828 . . . . . . . . 9 ((𝑎 |s 𝑏) = 𝑥 → ((𝑎 |s 𝑏) ∈ No 𝑥 No ))
43biimpd 230 . . . . . . . 8 ((𝑎 |s 𝑏) = 𝑥 → ((𝑎 |s 𝑏) ∈ No 𝑥 No ))
52, 4mpan9 511 . . . . . . 7 ((𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥) → 𝑥 No )
65rexlimivw 3137 . . . . . 6 (∃𝑏 ∈ 𝒫 ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥) → 𝑥 No )
76rexlimivw 3137 . . . . 5 (∃𝑎 ∈ 𝒫 ( M “ 𝐴)∃𝑏 ∈ 𝒫 ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥) → 𝑥 No )
87pm4.71ri 565 . . . 4 (∃𝑎 ∈ 𝒫 ( M “ 𝐴)∃𝑏 ∈ 𝒫 ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥) ↔ (𝑥 No ∧ ∃𝑎 ∈ 𝒫 ( M “ 𝐴)∃𝑏 ∈ 𝒫 ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥)))
98abbii 2807 . . 3 {𝑥 ∣ ∃𝑎 ∈ 𝒫 ( M “ 𝐴)∃𝑏 ∈ 𝒫 ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥)} = {𝑥 ∣ (𝑥 No ∧ ∃𝑎 ∈ 𝒫 ( M “ 𝐴)∃𝑏 ∈ 𝒫 ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥))}
10 eleq1 2828 . . . . . . 7 (𝑦 = ⟨𝑎, 𝑏⟩ → (𝑦 ∈ <<s ↔ ⟨𝑎, 𝑏⟩ ∈ <<s ))
11 breq1 5082 . . . . . . 7 (𝑦 = ⟨𝑎, 𝑏⟩ → (𝑦 |s 𝑥 ↔ ⟨𝑎, 𝑏⟩ |s 𝑥))
1210, 11anbi12d 638 . . . . . 6 (𝑦 = ⟨𝑎, 𝑏⟩ → ((𝑦 ∈ <<s ∧ 𝑦 |s 𝑥) ↔ (⟨𝑎, 𝑏⟩ ∈ <<s ∧ ⟨𝑎, 𝑏⟩ |s 𝑥)))
1312rexxp 5791 . . . . 5 (∃𝑦 ∈ (𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴))(𝑦 ∈ <<s ∧ 𝑦 |s 𝑥) ↔ ∃𝑎 ∈ 𝒫 ( M “ 𝐴)∃𝑏 ∈ 𝒫 ( M “ 𝐴)(⟨𝑎, 𝑏⟩ ∈ <<s ∧ ⟨𝑎, 𝑏⟩ |s 𝑥))
14 imaindm 6257 . . . . . . . 8 ( |s “ (𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴))) = ( |s “ ((𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∩ dom |s ))
15 dmcuts 27808 . . . . . . . . . 10 dom |s = <<s
1615ineq2i 4153 . . . . . . . . 9 ((𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∩ dom |s ) = ((𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∩ <<s )
1716imaeq2i 6017 . . . . . . . 8 ( |s “ ((𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∩ dom |s )) = ( |s “ ((𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∩ <<s ))
1814, 17eqtri 2763 . . . . . . 7 ( |s “ (𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴))) = ( |s “ ((𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∩ <<s ))
1918eleq2i 2832 . . . . . 6 (𝑥 ∈ ( |s “ (𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴))) ↔ 𝑥 ∈ ( |s “ ((𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∩ <<s )))
20 vex 3436 . . . . . . 7 𝑥 ∈ V
2120elima 6024 . . . . . 6 (𝑥 ∈ ( |s “ ((𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∩ <<s )) ↔ ∃𝑦 ∈ ((𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∩ <<s )𝑦 |s 𝑥)
22 elin 3906 . . . . . . . . 9 (𝑦 ∈ ((𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∩ <<s ) ↔ (𝑦 ∈ (𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∧ 𝑦 ∈ <<s ))
2322anbi1i 630 . . . . . . . 8 ((𝑦 ∈ ((𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∩ <<s ) ∧ 𝑦 |s 𝑥) ↔ ((𝑦 ∈ (𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∧ 𝑦 ∈ <<s ) ∧ 𝑦 |s 𝑥))
24 anass 469 . . . . . . . 8 (((𝑦 ∈ (𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∧ 𝑦 ∈ <<s ) ∧ 𝑦 |s 𝑥) ↔ (𝑦 ∈ (𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∧ (𝑦 ∈ <<s ∧ 𝑦 |s 𝑥)))
2523, 24bitri 276 . . . . . . 7 ((𝑦 ∈ ((𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∩ <<s ) ∧ 𝑦 |s 𝑥) ↔ (𝑦 ∈ (𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∧ (𝑦 ∈ <<s ∧ 𝑦 |s 𝑥)))
2625rexbii2 3083 . . . . . 6 (∃𝑦 ∈ ((𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∩ <<s )𝑦 |s 𝑥 ↔ ∃𝑦 ∈ (𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴))(𝑦 ∈ <<s ∧ 𝑦 |s 𝑥))
2719, 21, 263bitri 298 . . . . 5 (𝑥 ∈ ( |s “ (𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴))) ↔ ∃𝑦 ∈ (𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴))(𝑦 ∈ <<s ∧ 𝑦 |s 𝑥))
28 df-br 5080 . . . . . . . 8 (𝑎 <<s 𝑏 ↔ ⟨𝑎, 𝑏⟩ ∈ <<s )
2928anbi1i 630 . . . . . . 7 ((𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥) ↔ (⟨𝑎, 𝑏⟩ ∈ <<s ∧ (𝑎 |s 𝑏) = 𝑥))
30 df-ov 7366 . . . . . . . . . 10 (𝑎 |s 𝑏) = ( |s ‘⟨𝑎, 𝑏⟩)
3130eqeq1i 2745 . . . . . . . . 9 ((𝑎 |s 𝑏) = 𝑥 ↔ ( |s ‘⟨𝑎, 𝑏⟩) = 𝑥)
32 cutsf 27809 . . . . . . . . . . 11 |s : <<s ⟶ No
33 ffn 6662 . . . . . . . . . . 11 ( |s : <<s ⟶ No → |s Fn <<s )
3432, 33ax-mp 5 . . . . . . . . . 10 |s Fn <<s
35 fnbrfvb 6884 . . . . . . . . . 10 (( |s Fn <<s ∧ ⟨𝑎, 𝑏⟩ ∈ <<s ) → (( |s ‘⟨𝑎, 𝑏⟩) = 𝑥 ↔ ⟨𝑎, 𝑏⟩ |s 𝑥))
3634, 35mpan 696 . . . . . . . . 9 (⟨𝑎, 𝑏⟩ ∈ <<s → (( |s ‘⟨𝑎, 𝑏⟩) = 𝑥 ↔ ⟨𝑎, 𝑏⟩ |s 𝑥))
3731, 36bitrid 284 . . . . . . . 8 (⟨𝑎, 𝑏⟩ ∈ <<s → ((𝑎 |s 𝑏) = 𝑥 ↔ ⟨𝑎, 𝑏⟩ |s 𝑥))
3837pm5.32i 579 . . . . . . 7 ((⟨𝑎, 𝑏⟩ ∈ <<s ∧ (𝑎 |s 𝑏) = 𝑥) ↔ (⟨𝑎, 𝑏⟩ ∈ <<s ∧ ⟨𝑎, 𝑏⟩ |s 𝑥))
3929, 38bitri 276 . . . . . 6 ((𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥) ↔ (⟨𝑎, 𝑏⟩ ∈ <<s ∧ ⟨𝑎, 𝑏⟩ |s 𝑥))
40392rexbii 3116 . . . . 5 (∃𝑎 ∈ 𝒫 ( M “ 𝐴)∃𝑏 ∈ 𝒫 ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥) ↔ ∃𝑎 ∈ 𝒫 ( M “ 𝐴)∃𝑏 ∈ 𝒫 ( M “ 𝐴)(⟨𝑎, 𝑏⟩ ∈ <<s ∧ ⟨𝑎, 𝑏⟩ |s 𝑥))
4113, 27, 403bitr4i 304 . . . 4 (𝑥 ∈ ( |s “ (𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴))) ↔ ∃𝑎 ∈ 𝒫 ( M “ 𝐴)∃𝑏 ∈ 𝒫 ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥))
4241eqabi 2875 . . 3 ( |s “ (𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴))) = {𝑥 ∣ ∃𝑎 ∈ 𝒫 ( M “ 𝐴)∃𝑏 ∈ 𝒫 ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥)}
43 df-rab 3393 . . 3 {𝑥 No ∣ ∃𝑎 ∈ 𝒫 ( M “ 𝐴)∃𝑏 ∈ 𝒫 ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥)} = {𝑥 ∣ (𝑥 No ∧ ∃𝑎 ∈ 𝒫 ( M “ 𝐴)∃𝑏 ∈ 𝒫 ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥))}
449, 42, 433eqtr4i 2773 . 2 ( |s “ (𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴))) = {𝑥 No ∣ ∃𝑎 ∈ 𝒫 ( M “ 𝐴)∃𝑏 ∈ 𝒫 ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥)}
451, 44eqtrdi 2791 1 (𝐴 ∈ On → ( M ‘𝐴) = {𝑥 No ∣ ∃𝑎 ∈ 𝒫 ( M “ 𝐴)∃𝑏 ∈ 𝒫 ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥)})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396   = wceq 1547  wcel 2119  {cab 2718  wrex 3064  {crab 3392  cin 3889  𝒫 cpw 4536  cop 4568   cuni 4845   class class class wbr 5079   × cxp 5623  dom cdm 5625  cima 5628  Oncon0 6317   Fn wfn 6487  wf 6488  cfv 6492  (class class class)co 7363   No csur 27628   <<s cslts 27774   |s ccuts 27776   M cmade 27839
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-rep 5206  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-rmo 3345  df-reu 3346  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-tp 4567  df-op 4569  df-uni 4846  df-int 4885  df-iun 4930  df-br 5080  df-opab 5142  df-mpt 5161  df-tr 5187  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6259  df-ord 6320  df-on 6321  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7320  df-ov 7366  df-oprab 7367  df-mpo 7368  df-2nd 7939  df-frecs 8228  df-wrecs 8259  df-recs 8308  df-1o 8402  df-2o 8403  df-no 27631  df-lts 27632  df-bday 27633  df-slts 27775  df-cuts 27777  df-made 27844
This theorem is referenced by:  madef  27853  elmade  27874  made0  27880  madess  27883
  Copyright terms: Public domain W3C validator