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

Theorem madeval2 27903
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 27902 . 2 (𝐴 ∈ On → ( M ‘𝐴) = ( |s “ (𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴))))
2 cutscl 27852 . . . . . . . 8 (𝑎 <<s 𝑏 → (𝑎 |s 𝑏) ∈ No )
3 eleq1 2849 . . . . . . . . 9 ((𝑎 |s 𝑏) = 𝑥 → ((𝑎 |s 𝑏) ∈ No 𝑥 No ))
43biimpd 231 . . . . . . . 8 ((𝑎 |s 𝑏) = 𝑥 → ((𝑎 |s 𝑏) ∈ No 𝑥 No ))
52, 4mpan9 514 . . . . . . 7 ((𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥) → 𝑥 No )
65rexlimivw 3158 . . . . . 6 (∃𝑏 ∈ 𝒫 ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥) → 𝑥 No )
76rexlimivw 3158 . . . . 5 (∃𝑎 ∈ 𝒫 ( M “ 𝐴)∃𝑏 ∈ 𝒫 ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥) → 𝑥 No )
87pm4.71ri 568 . . . 4 (∃𝑎 ∈ 𝒫 ( M “ 𝐴)∃𝑏 ∈ 𝒫 ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥) ↔ (𝑥 No ∧ ∃𝑎 ∈ 𝒫 ( M “ 𝐴)∃𝑏 ∈ 𝒫 ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥)))
98abbii 2828 . . 3 {𝑥 ∣ ∃𝑎 ∈ 𝒫 ( M “ 𝐴)∃𝑏 ∈ 𝒫 ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥)} = {𝑥 ∣ (𝑥 No ∧ ∃𝑎 ∈ 𝒫 ( M “ 𝐴)∃𝑏 ∈ 𝒫 ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥))}
10 eleq1 2849 . . . . . . 7 (𝑦 = ⟨𝑎, 𝑏⟩ → (𝑦 ∈ <<s ↔ ⟨𝑎, 𝑏⟩ ∈ <<s ))
11 breq1 5102 . . . . . . 7 (𝑦 = ⟨𝑎, 𝑏⟩ → (𝑦 |s 𝑥 ↔ ⟨𝑎, 𝑏⟩ |s 𝑥))
1210, 11anbi12d 641 . . . . . 6 (𝑦 = ⟨𝑎, 𝑏⟩ → ((𝑦 ∈ <<s ∧ 𝑦 |s 𝑥) ↔ (⟨𝑎, 𝑏⟩ ∈ <<s ∧ ⟨𝑎, 𝑏⟩ |s 𝑥)))
1312rexxp 5812 . . . . 5 (∃𝑦 ∈ (𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴))(𝑦 ∈ <<s ∧ 𝑦 |s 𝑥) ↔ ∃𝑎 ∈ 𝒫 ( M “ 𝐴)∃𝑏 ∈ 𝒫 ( M “ 𝐴)(⟨𝑎, 𝑏⟩ ∈ <<s ∧ ⟨𝑎, 𝑏⟩ |s 𝑥))
14 imaindm 6282 . . . . . . . 8 ( |s “ (𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴))) = ( |s “ ((𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∩ dom |s ))
15 dmcuts 27861 . . . . . . . . . 10 dom |s = <<s
1615ineq2i 4169 . . . . . . . . 9 ((𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∩ dom |s ) = ((𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∩ <<s )
1716imaeq2i 6044 . . . . . . . 8 ( |s “ ((𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∩ dom |s )) = ( |s “ ((𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∩ <<s ))
1814, 17eqtri 2784 . . . . . . 7 ( |s “ (𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴))) = ( |s “ ((𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∩ <<s ))
1918eleq2i 2853 . . . . . 6 (𝑥 ∈ ( |s “ (𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴))) ↔ 𝑥 ∈ ( |s “ ((𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∩ <<s )))
20 vex 3457 . . . . . . 7 𝑥 ∈ V
2120elima 6051 . . . . . 6 (𝑥 ∈ ( |s “ ((𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∩ <<s )) ↔ ∃𝑦 ∈ ((𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∩ <<s )𝑦 |s 𝑥)
22 elin 3920 . . . . . . . . 9 (𝑦 ∈ ((𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∩ <<s ) ↔ (𝑦 ∈ (𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∧ 𝑦 ∈ <<s ))
2322anbi1i 633 . . . . . . . 8 ((𝑦 ∈ ((𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∩ <<s ) ∧ 𝑦 |s 𝑥) ↔ ((𝑦 ∈ (𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∧ 𝑦 ∈ <<s ) ∧ 𝑦 |s 𝑥))
24 anass 472 . . . . . . . 8 (((𝑦 ∈ (𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∧ 𝑦 ∈ <<s ) ∧ 𝑦 |s 𝑥) ↔ (𝑦 ∈ (𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∧ (𝑦 ∈ <<s ∧ 𝑦 |s 𝑥)))
2523, 24bitri 277 . . . . . . 7 ((𝑦 ∈ ((𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∩ <<s ) ∧ 𝑦 |s 𝑥) ↔ (𝑦 ∈ (𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∧ (𝑦 ∈ <<s ∧ 𝑦 |s 𝑥)))
2625rexbii2 3104 . . . . . 6 (∃𝑦 ∈ ((𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴)) ∩ <<s )𝑦 |s 𝑥 ↔ ∃𝑦 ∈ (𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴))(𝑦 ∈ <<s ∧ 𝑦 |s 𝑥))
2719, 21, 263bitri 299 . . . . 5 (𝑥 ∈ ( |s “ (𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴))) ↔ ∃𝑦 ∈ (𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴))(𝑦 ∈ <<s ∧ 𝑦 |s 𝑥))
28 df-br 5100 . . . . . . . 8 (𝑎 <<s 𝑏 ↔ ⟨𝑎, 𝑏⟩ ∈ <<s )
2928anbi1i 633 . . . . . . 7 ((𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥) ↔ (⟨𝑎, 𝑏⟩ ∈ <<s ∧ (𝑎 |s 𝑏) = 𝑥))
30 df-ov 7395 . . . . . . . . . 10 (𝑎 |s 𝑏) = ( |s ‘⟨𝑎, 𝑏⟩)
3130eqeq1i 2766 . . . . . . . . 9 ((𝑎 |s 𝑏) = 𝑥 ↔ ( |s ‘⟨𝑎, 𝑏⟩) = 𝑥)
32 cutsf 27862 . . . . . . . . . . 11 |s : <<s ⟶ No
33 ffn 6687 . . . . . . . . . . 11 ( |s : <<s ⟶ No → |s Fn <<s )
3432, 33ax-mp 5 . . . . . . . . . 10 |s Fn <<s
35 fnbrfvb 6913 . . . . . . . . . 10 (( |s Fn <<s ∧ ⟨𝑎, 𝑏⟩ ∈ <<s ) → (( |s ‘⟨𝑎, 𝑏⟩) = 𝑥 ↔ ⟨𝑎, 𝑏⟩ |s 𝑥))
3634, 35mpan 700 . . . . . . . . 9 (⟨𝑎, 𝑏⟩ ∈ <<s → (( |s ‘⟨𝑎, 𝑏⟩) = 𝑥 ↔ ⟨𝑎, 𝑏⟩ |s 𝑥))
3731, 36bitrid 285 . . . . . . . 8 (⟨𝑎, 𝑏⟩ ∈ <<s → ((𝑎 |s 𝑏) = 𝑥 ↔ ⟨𝑎, 𝑏⟩ |s 𝑥))
3837pm5.32i 582 . . . . . . 7 ((⟨𝑎, 𝑏⟩ ∈ <<s ∧ (𝑎 |s 𝑏) = 𝑥) ↔ (⟨𝑎, 𝑏⟩ ∈ <<s ∧ ⟨𝑎, 𝑏⟩ |s 𝑥))
3929, 38bitri 277 . . . . . 6 ((𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥) ↔ (⟨𝑎, 𝑏⟩ ∈ <<s ∧ ⟨𝑎, 𝑏⟩ |s 𝑥))
40392rexbii 3137 . . . . 5 (∃𝑎 ∈ 𝒫 ( M “ 𝐴)∃𝑏 ∈ 𝒫 ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥) ↔ ∃𝑎 ∈ 𝒫 ( M “ 𝐴)∃𝑏 ∈ 𝒫 ( M “ 𝐴)(⟨𝑎, 𝑏⟩ ∈ <<s ∧ ⟨𝑎, 𝑏⟩ |s 𝑥))
4113, 27, 403bitr4i 305 . . . 4 (𝑥 ∈ ( |s “ (𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴))) ↔ ∃𝑎 ∈ 𝒫 ( M “ 𝐴)∃𝑏 ∈ 𝒫 ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥))
4241eqabi 2896 . . 3 ( |s “ (𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴))) = {𝑥 ∣ ∃𝑎 ∈ 𝒫 ( M “ 𝐴)∃𝑏 ∈ 𝒫 ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥)}
43 df-rab 3414 . . 3 {𝑥 No ∣ ∃𝑎 ∈ 𝒫 ( M “ 𝐴)∃𝑏 ∈ 𝒫 ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥)} = {𝑥 ∣ (𝑥 No ∧ ∃𝑎 ∈ 𝒫 ( M “ 𝐴)∃𝑏 ∈ 𝒫 ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥))}
449, 42, 433eqtr4i 2794 . 2 ( |s “ (𝒫 ( M “ 𝐴) × 𝒫 ( M “ 𝐴))) = {𝑥 No ∣ ∃𝑎 ∈ 𝒫 ( M “ 𝐴)∃𝑏 ∈ 𝒫 ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥)}
451, 44eqtrdi 2812 1 (𝐴 ∈ On → ( M ‘𝐴) = {𝑥 No ∣ ∃𝑎 ∈ 𝒫 ( M “ 𝐴)∃𝑏 ∈ 𝒫 ( M “ 𝐴)(𝑎 <<s 𝑏 ∧ (𝑎 |s 𝑏) = 𝑥)})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399   = wceq 1559  wcel 2141  {cab 2739  wrex 3085  {crab 3413  cin 3903  𝒫 cpw 4554  cop 4587   cuni 4864   class class class wbr 5099   × cxp 5643  dom cdm 5645  cima 5648  Oncon0 6342   Fn wfn 6512  wf 6513  cfv 6517  (class class class)co 7392   No csur 27681   <<s cslts 27827   |s ccuts 27829   M cmade 27892
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pow 5321  ax-pr 5389  ax-un 7714
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-tp 4586  df-op 4588  df-uni 4865  df-int 4905  df-iun 4950  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5540  df-eprel 5545  df-po 5553  df-so 5554  df-fr 5598  df-we 5600  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-res 5657  df-ima 5658  df-pred 6284  df-ord 6345  df-on 6346  df-suc 6348  df-iota 6473  df-fun 6519  df-fn 6520  df-f 6521  df-f1 6522  df-fo 6523  df-f1o 6524  df-fv 6525  df-riota 7349  df-ov 7395  df-oprab 7396  df-mpo 7397  df-2nd 7967  df-frecs 8257  df-wrecs 8288  df-recs 8337  df-1o 8432  df-2o 8433  df-no 27684  df-lts 27685  df-bday 27686  df-slts 27828  df-cuts 27830  df-made 27897
This theorem is referenced by:  madef  27906  elmade  27927  made0  27933  madess  27936
  Copyright terms: Public domain W3C validator