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

Theorem cantnff1o 9734
Description: Simplify the isomorphism of cantnf 9731 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-1onto(𝐴 ↑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 2763 . . 3 {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐵 ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)))} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐵 ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)))}
51, 2, 3, 4cantnf 9731 . 2 (𝜑 → (𝐴 CNF 𝐵) Isom {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐵 ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)))}, E (𝑆, (𝐴 ↑o 𝐵)))
6 isof1o 7362 . 2 ((𝐴 CNF 𝐵) Isom {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐵 ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)))}, E (𝑆, (𝐴 ↑o 𝐵)) → (𝐴 CNF 𝐵):𝑆⟶1-1onto(𝐴 ↑o 𝐵))
75, 6syl 18 1 (𝜑 → (𝐴 CNF 𝐵):𝑆⟶1-1onto(𝐴 ↑o 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  {copab 5173   E cep 5557  dom cdm 5658  Oncon0 6388  ⟶1-1ontowf1o 6565  ‘cfv 6566   Isom wiso 6567  (class class class)co 7451   ↑o coe 8513   CNF ccnf 9699
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-se 5612  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-isom 6575  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-supp 8215  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-seqom 8496  df-1o 8514  df-2o 8515  df-oadd 8518  df-omul 8519  df-oexp 8520  df-er 8755  df-map 8887  df-en 9012  df-dom 9013  df-sdom 9014  df-fin 9015  df-fsupp 9392  df-oi 9541  df-cnf 9700
This theorem is used by:  oef1o  9736  cnfcomlem  9737  cnfcom  9738  cnfcom2lem  9739  cnfcom2  9740  cnfcom3lem  9741  cnfcom3  9742  cantnf2  44588
  Copyright terms: Public domain W3C validator