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

Theorem cantnff1o 9159
Description: Simplify the isomorphism of cantnf 9156 to simple bijection. (Contributed by Mario Carneiro, 30-May-2015.)
Hypotheses
Ref Expression
cantnff1o.1 𝑆 = dom (𝐴 CNF 𝐵)
cantnff1o.2 (𝜑𝐴 ∈ On)
cantnff1o.3 (𝜑𝐵 ∈ On)
Assertion
Ref Expression
cantnff1o (𝜑 → (𝐴 CNF 𝐵):𝑆1-1-onto→(𝐴o 𝐵))

Proof of Theorem cantnff1o
Dummy variables 𝑥 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cantnff1o.1 . . 3 𝑆 = dom (𝐴 CNF 𝐵)
2 cantnff1o.2 . . 3 (𝜑𝐴 ∈ On)
3 cantnff1o.3 . . 3 (𝜑𝐵 ∈ On)
4 eqid 2821 . . 3 {⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐵 ((𝑥𝑧) ∈ (𝑦𝑧) ∧ ∀𝑤𝐵 (𝑧𝑤 → (𝑥𝑤) = (𝑦𝑤)))} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐵 ((𝑥𝑧) ∈ (𝑦𝑧) ∧ ∀𝑤𝐵 (𝑧𝑤 → (𝑥𝑤) = (𝑦𝑤)))}
51, 2, 3, 4cantnf 9156 . 2 (𝜑 → (𝐴 CNF 𝐵) Isom {⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐵 ((𝑥𝑧) ∈ (𝑦𝑧) ∧ ∀𝑤𝐵 (𝑧𝑤 → (𝑥𝑤) = (𝑦𝑤)))}, E (𝑆, (𝐴o 𝐵)))
6 isof1o 7076 . 2 ((𝐴 CNF 𝐵) Isom {⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐵 ((𝑥𝑧) ∈ (𝑦𝑧) ∧ ∀𝑤𝐵 (𝑧𝑤 → (𝑥𝑤) = (𝑦𝑤)))}, E (𝑆, (𝐴o 𝐵)) → (𝐴 CNF 𝐵):𝑆1-1-onto→(𝐴o 𝐵))
75, 6syl 17 1 (𝜑 → (𝐴 CNF 𝐵):𝑆1-1-onto→(𝐴o 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1537  wcel 2114  wral 3138  wrex 3139  {copab 5128   E cep 5464  dom cdm 5555  Oncon0 6191  1-1-ontowf1o 6354  cfv 6355   Isom wiso 6356  (class class class)co 7156  o coe 8101   CNF ccnf 9124
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-rep 5190  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-fal 1550  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-pss 3954  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4839  df-int 4877  df-iun 4921  df-br 5067  df-opab 5129  df-mpt 5147  df-tr 5173  df-id 5460  df-eprel 5465  df-po 5474  df-so 5475  df-fr 5514  df-se 5515  df-we 5516  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-pred 6148  df-ord 6194  df-on 6195  df-lim 6196  df-suc 6197  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363  df-isom 6364  df-riota 7114  df-ov 7159  df-oprab 7160  df-mpo 7161  df-om 7581  df-1st 7689  df-2nd 7690  df-supp 7831  df-wrecs 7947  df-recs 8008  df-rdg 8046  df-seqom 8084  df-1o 8102  df-2o 8103  df-oadd 8106  df-omul 8107  df-oexp 8108  df-er 8289  df-map 8408  df-en 8510  df-dom 8511  df-sdom 8512  df-fin 8513  df-fsupp 8834  df-oi 8974  df-cnf 9125
This theorem is referenced by:  oef1o  9161  cnfcomlem  9162  cnfcom  9163  cnfcom2lem  9164  cnfcom2  9165  cnfcom3lem  9166  cnfcom3  9167
  Copyright terms: Public domain W3C validator