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

Theorem cantnffval2 9591
Description: An alternate definition of df-cnf 9558 which relies on cantnf 9589. (Note that although the use of 𝑆 seems self-referential, one can use cantnfdm 9560 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 9589 . . . 4 (𝜑 → (𝐴 CNF 𝐵) Isom 𝑇, E (𝑆, (𝐴o 𝐵)))
6 isof1o 7260 . . . 4 ((𝐴 CNF 𝐵) Isom 𝑇, E (𝑆, (𝐴o 𝐵)) → (𝐴 CNF 𝐵):𝑆1-1-onto→(𝐴o 𝐵))
7 f1orel 6767 . . . 4 ((𝐴 CNF 𝐵):𝑆1-1-onto→(𝐴o 𝐵) → Rel (𝐴 CNF 𝐵))
85, 6, 73syl 18 . . 3 (𝜑 → Rel (𝐴 CNF 𝐵))
9 dfrel2 6138 . . 3 (Rel (𝐴 CNF 𝐵) ↔ (𝐴 CNF 𝐵) = (𝐴 CNF 𝐵))
108, 9sylib 218 . 2 (𝜑(𝐴 CNF 𝐵) = (𝐴 CNF 𝐵))
11 oecl 8455 . . . . . . 7 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴o 𝐵) ∈ On)
122, 3, 11syl2anc 584 . . . . . 6 (𝜑 → (𝐴o 𝐵) ∈ On)
13 eloni 6317 . . . . . 6 ((𝐴o 𝐵) ∈ On → Ord (𝐴o 𝐵))
1412, 13syl 17 . . . . 5 (𝜑 → Ord (𝐴o 𝐵))
15 isocnv 7267 . . . . . 6 ((𝐴 CNF 𝐵) Isom 𝑇, E (𝑆, (𝐴o 𝐵)) → (𝐴 CNF 𝐵) Isom E , 𝑇 ((𝐴o 𝐵), 𝑆))
165, 15syl 17 . . . . 5 (𝜑(𝐴 CNF 𝐵) Isom E , 𝑇 ((𝐴o 𝐵), 𝑆))
171, 2, 3, 4oemapwe 9590 . . . . . . 7 (𝜑 → (𝑇 We 𝑆 ∧ dom OrdIso(𝑇, 𝑆) = (𝐴o 𝐵)))
1817simpld 494 . . . . . 6 (𝜑𝑇 We 𝑆)
19 ovex 7382 . . . . . . . . 9 (𝐴 CNF 𝐵) ∈ V
2019dmex 7842 . . . . . . . 8 dom (𝐴 CNF 𝐵) ∈ V
211, 20eqeltri 2824 . . . . . . 7 𝑆 ∈ V
22 exse 5579 . . . . . . 7 (𝑆 ∈ V → 𝑇 Se 𝑆)
2321, 22ax-mp 5 . . . . . 6 𝑇 Se 𝑆
24 eqid 2729 . . . . . . 7 OrdIso(𝑇, 𝑆) = OrdIso(𝑇, 𝑆)
2524oieu 9431 . . . . . 6 ((𝑇 We 𝑆𝑇 Se 𝑆) → ((Ord (𝐴o 𝐵) ∧ (𝐴 CNF 𝐵) Isom E , 𝑇 ((𝐴o 𝐵), 𝑆)) ↔ ((𝐴o 𝐵) = dom OrdIso(𝑇, 𝑆) ∧ (𝐴 CNF 𝐵) = OrdIso(𝑇, 𝑆))))
2618, 23, 25sylancl 586 . . . . 5 (𝜑 → ((Ord (𝐴o 𝐵) ∧ (𝐴 CNF 𝐵) Isom E , 𝑇 ((𝐴o 𝐵), 𝑆)) ↔ ((𝐴o 𝐵) = dom OrdIso(𝑇, 𝑆) ∧ (𝐴 CNF 𝐵) = OrdIso(𝑇, 𝑆))))
2714, 16, 26mpbi2and 712 . . . 4 (𝜑 → ((𝐴o 𝐵) = dom OrdIso(𝑇, 𝑆) ∧ (𝐴 CNF 𝐵) = OrdIso(𝑇, 𝑆)))
2827simprd 495 . . 3 (𝜑(𝐴 CNF 𝐵) = OrdIso(𝑇, 𝑆))
2928cnveqd 5818 . 2 (𝜑(𝐴 CNF 𝐵) = OrdIso(𝑇, 𝑆))
3010, 29eqtr3d 2766 1 (𝜑 → (𝐴 CNF 𝐵) = OrdIso(𝑇, 𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1540  wcel 2109  wral 3044  wrex 3053  Vcvv 3436  {copab 5154   E cep 5518   Se wse 5570   We wwe 5571  ccnv 5618  dom cdm 5619  Rel wrel 5624  Ord word 6306  Oncon0 6307  1-1-ontowf1o 6481  cfv 6482   Isom wiso 6483  (class class class)co 7349  o coe 8387  OrdIsocoi 9401   CNF ccnf 9557
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5218  ax-sep 5235  ax-nul 5245  ax-pow 5304  ax-pr 5371  ax-un 7671
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3343  df-reu 3344  df-rab 3395  df-v 3438  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4859  df-int 4897  df-iun 4943  df-br 5093  df-opab 5155  df-mpt 5174  df-tr 5200  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-se 5573  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-pred 6249  df-ord 6310  df-on 6311  df-lim 6312  df-suc 6313  df-iota 6438  df-fun 6484  df-fn 6485  df-f 6486  df-f1 6487  df-fo 6488  df-f1o 6489  df-fv 6490  df-isom 6491  df-riota 7306  df-ov 7352  df-oprab 7353  df-mpo 7354  df-om 7800  df-1st 7924  df-2nd 7925  df-supp 8094  df-frecs 8214  df-wrecs 8245  df-recs 8294  df-rdg 8332  df-seqom 8370  df-1o 8388  df-2o 8389  df-oadd 8392  df-omul 8393  df-oexp 8394  df-er 8625  df-map 8755  df-en 8873  df-dom 8874  df-sdom 8875  df-fin 8876  df-fsupp 9252  df-oi 9402  df-cnf 9558
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator