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

Theorem cantnffval2 9607
Description: An alternate definition of df-cnf 9574 which relies on cantnf 9605. (Note that although the use of 𝑆 seems self-referential, one can use cantnfdm 9576 to eliminate it.) (Contributed by Mario Carneiro, 28-May-2015.)
Hypotheses
Ref Expression
cantnfs.s 𝑆 = dom (𝐴 CNF 𝐵)
cantnfs.a (𝜑𝐴 ∈ On)
cantnfs.b (𝜑𝐵 ∈ On)
oemapval.t 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐵 ((𝑥𝑧) ∈ (𝑦𝑧) ∧ ∀𝑤𝐵 (𝑧𝑤 → (𝑥𝑤) = (𝑦𝑤)))}
Assertion
Ref Expression
cantnffval2 (𝜑 → (𝐴 CNF 𝐵) = OrdIso(𝑇, 𝑆))
Distinct variable groups:   𝑥,𝑤,𝑦,𝑧,𝐵   𝑤,𝐴,𝑥,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧
Allowed substitution hints:   𝜑(𝑤)   𝑆(𝑤)   𝑇(𝑥,𝑦,𝑧,𝑤)

Proof of Theorem cantnffval2
StepHypRef Expression
1 cantnfs.s . . . . 5 𝑆 = dom (𝐴 CNF 𝐵)
2 cantnfs.a . . . . 5 (𝜑𝐴 ∈ On)
3 cantnfs.b . . . . 5 (𝜑𝐵 ∈ On)
4 oemapval.t . . . . 5 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐵 ((𝑥𝑧) ∈ (𝑦𝑧) ∧ ∀𝑤𝐵 (𝑧𝑤 → (𝑥𝑤) = (𝑦𝑤)))}
51, 2, 3, 4cantnf 9605 . . . 4 (𝜑 → (𝐴 CNF 𝐵) Isom 𝑇, E (𝑆, (𝐴o 𝐵)))
6 isof1o 7267 . . . 4 ((𝐴 CNF 𝐵) Isom 𝑇, E (𝑆, (𝐴o 𝐵)) → (𝐴 CNF 𝐵):𝑆1-1-onto→(𝐴o 𝐵))
7 f1orel 6770 . . . 4 ((𝐴 CNF 𝐵):𝑆1-1-onto→(𝐴o 𝐵) → Rel (𝐴 CNF 𝐵))
85, 6, 73syl 18 . . 3 (𝜑 → Rel (𝐴 CNF 𝐵))
9 dfrel2 6140 . . 3 (Rel (𝐴 CNF 𝐵) ↔ (𝐴 CNF 𝐵) = (𝐴 CNF 𝐵))
108, 9sylib 219 . 2 (𝜑(𝐴 CNF 𝐵) = (𝐴 CNF 𝐵))
11 oecl 8462 . . . . . . 7 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴o 𝐵) ∈ On)
122, 3, 11syl2anc 590 . . . . . 6 (𝜑 → (𝐴o 𝐵) ∈ On)
13 eloni 6320 . . . . . 6 ((𝐴o 𝐵) ∈ On → Ord (𝐴o 𝐵))
1412, 13syl 17 . . . . 5 (𝜑 → Ord (𝐴o 𝐵))
15 isocnv 7274 . . . . . 6 ((𝐴 CNF 𝐵) Isom 𝑇, E (𝑆, (𝐴o 𝐵)) → (𝐴 CNF 𝐵) Isom E , 𝑇 ((𝐴o 𝐵), 𝑆))
165, 15syl 17 . . . . 5 (𝜑(𝐴 CNF 𝐵) Isom E , 𝑇 ((𝐴o 𝐵), 𝑆))
171, 2, 3, 4oemapwe 9606 . . . . . . 7 (𝜑 → (𝑇 We 𝑆 ∧ dom OrdIso(𝑇, 𝑆) = (𝐴o 𝐵)))
1817simpld 495 . . . . . 6 (𝜑𝑇 We 𝑆)
19 ovex 7389 . . . . . . . . 9 (𝐴 CNF 𝐵) ∈ V
2019dmex 7849 . . . . . . . 8 dom (𝐴 CNF 𝐵) ∈ V
211, 20eqeltri 2835 . . . . . . 7 𝑆 ∈ V
22 exse 5578 . . . . . . 7 (𝑆 ∈ V → 𝑇 Se 𝑆)
2321, 22ax-mp 5 . . . . . 6 𝑇 Se 𝑆
24 eqid 2739 . . . . . . 7 OrdIso(𝑇, 𝑆) = OrdIso(𝑇, 𝑆)
2524oieu 9444 . . . . . 6 ((𝑇 We 𝑆𝑇 Se 𝑆) → ((Ord (𝐴o 𝐵) ∧ (𝐴 CNF 𝐵) Isom E , 𝑇 ((𝐴o 𝐵), 𝑆)) ↔ ((𝐴o 𝐵) = dom OrdIso(𝑇, 𝑆) ∧ (𝐴 CNF 𝐵) = OrdIso(𝑇, 𝑆))))
2618, 23, 25sylancl 592 . . . . 5 (𝜑 → ((Ord (𝐴o 𝐵) ∧ (𝐴 CNF 𝐵) Isom E , 𝑇 ((𝐴o 𝐵), 𝑆)) ↔ ((𝐴o 𝐵) = dom OrdIso(𝑇, 𝑆) ∧ (𝐴 CNF 𝐵) = OrdIso(𝑇, 𝑆))))
2714, 16, 26mpbi2and 718 . . . 4 (𝜑 → ((𝐴o 𝐵) = dom OrdIso(𝑇, 𝑆) ∧ (𝐴 CNF 𝐵) = OrdIso(𝑇, 𝑆)))
2827simprd 496 . . 3 (𝜑(𝐴 CNF 𝐵) = OrdIso(𝑇, 𝑆))
2928cnveqd 5817 . 2 (𝜑(𝐴 CNF 𝐵) = OrdIso(𝑇, 𝑆))
3010, 29eqtr3d 2776 1 (𝜑 → (𝐴 CNF 𝐵) = OrdIso(𝑇, 𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396   = wceq 1547  wcel 2119  wral 3053  wrex 3063  Vcvv 3431  {copab 5134   E cep 5517   Se wse 5569   We wwe 5570  ccnv 5617  dom cdm 5618  Rel wrel 5623  Ord word 6309  Oncon0 6310  1-1-ontowf1o 6484  cfv 6485   Isom wiso 6486  (class class class)co 7356  o coe 8394  OrdIsocoi 9414   CNF ccnf 9573
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 2711  ax-rep 5199  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678
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 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rmo 3344  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3903  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-int 4878  df-iun 4923  df-br 5073  df-opab 5135  df-mpt 5154  df-tr 5180  df-id 5513  df-eprel 5518  df-po 5526  df-so 5527  df-fr 5571  df-se 5572  df-we 5573  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-pred 6252  df-ord 6313  df-on 6314  df-lim 6315  df-suc 6316  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-isom 6494  df-riota 7313  df-ov 7359  df-oprab 7360  df-mpo 7361  df-om 7807  df-1st 7931  df-2nd 7932  df-supp 8101  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-rdg 8339  df-seqom 8377  df-1o 8395  df-2o 8396  df-oadd 8399  df-omul 8400  df-oexp 8401  df-er 8633  df-map 8765  df-en 8884  df-dom 8885  df-sdom 8886  df-fin 8887  df-fsupp 9265  df-oi 9415  df-cnf 9574
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator