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

Theorem cantnffval2 9624
Description: An alternate definition of df-cnf 9591 which relies on cantnf 9622. (Note that although the use of 𝑆 seems self-referential, one can use cantnfdm 9593 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 9622 . . . 4 (𝜑 → (𝐴 CNF 𝐵) Isom 𝑇, E (𝑆, (𝐴o 𝐵)))
6 isof1o 7280 . . . 4 ((𝐴 CNF 𝐵) Isom 𝑇, E (𝑆, (𝐴o 𝐵)) → (𝐴 CNF 𝐵):𝑆1-1-onto→(𝐴o 𝐵))
7 f1orel 6785 . . . 4 ((𝐴 CNF 𝐵):𝑆1-1-onto→(𝐴o 𝐵) → Rel (𝐴 CNF 𝐵))
85, 6, 73syl 18 . . 3 (𝜑 → Rel (𝐴 CNF 𝐵))
9 dfrel2 6150 . . 3 (Rel (𝐴 CNF 𝐵) ↔ (𝐴 CNF 𝐵) = (𝐴 CNF 𝐵))
108, 9sylib 218 . 2 (𝜑(𝐴 CNF 𝐵) = (𝐴 CNF 𝐵))
11 oecl 8478 . . . . . . 7 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴o 𝐵) ∈ On)
122, 3, 11syl2anc 584 . . . . . 6 (𝜑 → (𝐴o 𝐵) ∈ On)
13 eloni 6330 . . . . . 6 ((𝐴o 𝐵) ∈ On → Ord (𝐴o 𝐵))
1412, 13syl 17 . . . . 5 (𝜑 → Ord (𝐴o 𝐵))
15 isocnv 7287 . . . . . 6 ((𝐴 CNF 𝐵) Isom 𝑇, E (𝑆, (𝐴o 𝐵)) → (𝐴 CNF 𝐵) Isom E , 𝑇 ((𝐴o 𝐵), 𝑆))
165, 15syl 17 . . . . 5 (𝜑(𝐴 CNF 𝐵) Isom E , 𝑇 ((𝐴o 𝐵), 𝑆))
171, 2, 3, 4oemapwe 9623 . . . . . . 7 (𝜑 → (𝑇 We 𝑆 ∧ dom OrdIso(𝑇, 𝑆) = (𝐴o 𝐵)))
1817simpld 494 . . . . . 6 (𝜑𝑇 We 𝑆)
19 ovex 7402 . . . . . . . . 9 (𝐴 CNF 𝐵) ∈ V
2019dmex 7865 . . . . . . . 8 dom (𝐴 CNF 𝐵) ∈ V
211, 20eqeltri 2824 . . . . . . 7 𝑆 ∈ V
22 exse 5591 . . . . . . 7 (𝑆 ∈ V → 𝑇 Se 𝑆)
2321, 22ax-mp 5 . . . . . 6 𝑇 Se 𝑆
24 eqid 2729 . . . . . . 7 OrdIso(𝑇, 𝑆) = OrdIso(𝑇, 𝑆)
2524oieu 9468 . . . . . 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 5829 . 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 3444  {copab 5164   E cep 5530   Se wse 5582   We wwe 5583  ccnv 5630  dom cdm 5631  Rel wrel 5636  Ord word 6319  Oncon0 6320  1-1-ontowf1o 6498  cfv 6499   Isom wiso 6500  (class class class)co 7369  o coe 8410  OrdIsocoi 9438   CNF ccnf 9590
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 5229  ax-sep 5246  ax-nul 5256  ax-pow 5315  ax-pr 5382  ax-un 7691
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 3351  df-reu 3352  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-pss 3931  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-int 4907  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-tr 5210  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-se 5585  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6262  df-ord 6323  df-on 6324  df-lim 6325  df-suc 6326  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-isom 6508  df-riota 7326  df-ov 7372  df-oprab 7373  df-mpo 7374  df-om 7823  df-1st 7947  df-2nd 7948  df-supp 8117  df-frecs 8237  df-wrecs 8268  df-recs 8317  df-rdg 8355  df-seqom 8393  df-1o 8411  df-2o 8412  df-oadd 8415  df-omul 8416  df-oexp 8417  df-er 8648  df-map 8778  df-en 8896  df-dom 8897  df-sdom 8898  df-fin 8899  df-fsupp 9289  df-oi 9439  df-cnf 9591
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator