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

Theorem cantnffval2 9660
Description: An alternate definition of df-cnf 9627 which relies on cantnf 9658. (Note that although the use of 𝑆 seems self-referential, one can use cantnfdm 9629 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 9658 . . . 4 (𝜑 → (𝐴 CNF 𝐵) Isom 𝑇, E (𝑆, (𝐴o 𝐵)))
6 isof1o 7319 . . . 4 ((𝐴 CNF 𝐵) Isom 𝑇, E (𝑆, (𝐴o 𝐵)) → (𝐴 CNF 𝐵):𝑆1-1-onto→(𝐴o 𝐵))
7 f1orel 6821 . . . 4 ((𝐴 CNF 𝐵):𝑆1-1-onto→(𝐴o 𝐵) → Rel (𝐴 CNF 𝐵))
85, 6, 73syl 19 . . 3 (𝜑 → Rel (𝐴 CNF 𝐵))
9 dfrel2 6186 . . 3 (Rel (𝐴 CNF 𝐵) ↔ (𝐴 CNF 𝐵) = (𝐴 CNF 𝐵))
108, 9sylib 221 . 2 (𝜑(𝐴 CNF 𝐵) = (𝐴 CNF 𝐵))
11 oecl 8518 . . . . . . 7 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴o 𝐵) ∈ On)
122, 3, 11syl2anc 595 . . . . . 6 (𝜑 → (𝐴o 𝐵) ∈ On)
13 eloni 6367 . . . . . 6 ((𝐴o 𝐵) ∈ On → Ord (𝐴o 𝐵))
1412, 13syl 18 . . . . 5 (𝜑 → Ord (𝐴o 𝐵))
15 isocnv 7326 . . . . . 6 ((𝐴 CNF 𝐵) Isom 𝑇, E (𝑆, (𝐴o 𝐵)) → (𝐴 CNF 𝐵) Isom E , 𝑇 ((𝐴o 𝐵), 𝑆))
165, 15syl 18 . . . . 5 (𝜑(𝐴 CNF 𝐵) Isom E , 𝑇 ((𝐴o 𝐵), 𝑆))
171, 2, 3, 4oemapwe 9659 . . . . . . 7 (𝜑 → (𝑇 We 𝑆 ∧ dom OrdIso(𝑇, 𝑆) = (𝐴o 𝐵)))
1817simpld 499 . . . . . 6 (𝜑𝑇 We 𝑆)
19 ovex 7441 . . . . . . . . 9 (𝐴 CNF 𝐵) ∈ V
2019dmex 7902 . . . . . . . 8 dom (𝐴 CNF 𝐵) ∈ V
211, 20eqeltri 2865 . . . . . . 7 𝑆 ∈ V
22 exse 5619 . . . . . . 7 (𝑆 ∈ V → 𝑇 Se 𝑆)
2321, 22ax-mp 5 . . . . . 6 𝑇 Se 𝑆
24 eqid 2769 . . . . . . 7 OrdIso(𝑇, 𝑆) = OrdIso(𝑇, 𝑆)
2524oieu 9497 . . . . . 6 ((𝑇 We 𝑆𝑇 Se 𝑆) → ((Ord (𝐴o 𝐵) ∧ (𝐴 CNF 𝐵) Isom E , 𝑇 ((𝐴o 𝐵), 𝑆)) ↔ ((𝐴o 𝐵) = dom OrdIso(𝑇, 𝑆) ∧ (𝐴 CNF 𝐵) = OrdIso(𝑇, 𝑆))))
2618, 23, 25sylancl 597 . . . . 5 (𝜑 → ((Ord (𝐴o 𝐵) ∧ (𝐴 CNF 𝐵) Isom E , 𝑇 ((𝐴o 𝐵), 𝑆)) ↔ ((𝐴o 𝐵) = dom OrdIso(𝑇, 𝑆) ∧ (𝐴 CNF 𝐵) = OrdIso(𝑇, 𝑆))))
2714, 16, 26mpbi2and 724 . . . 4 (𝜑 → ((𝐴o 𝐵) = dom OrdIso(𝑇, 𝑆) ∧ (𝐴 CNF 𝐵) = OrdIso(𝑇, 𝑆)))
2827simprd 500 . . 3 (𝜑(𝐴 CNF 𝐵) = OrdIso(𝑇, 𝑆))
2928cnveqd 5859 . 2 (𝜑(𝐴 CNF 𝐵) = OrdIso(𝑇, 𝑆))
3010, 29eqtr3d 2806 1 (𝜑 → (𝐴 CNF 𝐵) = OrdIso(𝑇, 𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1567  wcel 2149  wral 3085  wrex 3095  Vcvv 3463  {copab 5174   E cep 5558   Se wse 5610   We wwe 5611  ccnv 5658  dom cdm 5659  Rel wrel 5664  Ord word 6356  Oncon0 6357  1-1-ontowf1o 6532  cfv 6533   Isom wiso 6534  (class class class)co 7408  o coe 8448  OrdIsocoi 9467   CNF ccnf 9626
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5239  ax-sep 5258  ax-nul 5268  ax-pow 5334  ax-pr 5402  ax-un 7730
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-int 4914  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-se 5613  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 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-isom 6542  df-riota 7365  df-ov 7411  df-oprab 7412  df-mpo 7413  df-om 7859  df-1st 7982  df-2nd 7983  df-supp 8153  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-seqom 8431  df-1o 8449  df-2o 8450  df-oadd 8453  df-omul 8454  df-oexp 8455  df-er 8690  df-map 8822  df-en 8940  df-dom 8941  df-sdom 8942  df-fin 8943  df-fsupp 9318  df-oi 9468  df-cnf 9627
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator