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

Theorem gch-kn 9187
Description: The equivalence of two versions of the Generalized Continuum Hypothesis. The right-hand side is the standard version in the literature. The left-hand side is a version devised by Kannan Nambiar, which he calls the Axiom of Combinatorial Sets. For the notation and motivation behind this axiom, see his paper, "Derivation of Continuum Hypothesis from Axiom of Combinatorial Sets," available at http://www.e-atheneum.net/science/derivation_ch.pdf. The equivalence of the two sides provides a negative answer to Open Problem 2 in http://www.e-atheneum.net/science/open_problem_print.pdf. The key idea in the proof below is to equate both sides of alephexp2 9091 to the successor aleph using enen2 7797. (Contributed by NM, 1-Oct-2004.)
Assertion
Ref Expression
gch-kn (𝐴 ∈ On → ((ℵ‘suc 𝐴) ≈ {𝑥 ∣ (𝑥 ⊆ (ℵ‘𝐴) ∧ 𝑥 ≈ (ℵ‘𝐴))} ↔ (ℵ‘suc 𝐴) ≈ (2𝑜𝑚 (ℵ‘𝐴))))
Distinct variable group:   𝑥,𝐴

Proof of Theorem gch-kn
StepHypRef Expression
1 alephexp2 9091 . . 3 (𝐴 ∈ On → (2𝑜𝑚 (ℵ‘𝐴)) ≈ {𝑥 ∣ (𝑥 ⊆ (ℵ‘𝐴) ∧ 𝑥 ≈ (ℵ‘𝐴))})
2 enen2 7797 . . 3 ((2𝑜𝑚 (ℵ‘𝐴)) ≈ {𝑥 ∣ (𝑥 ⊆ (ℵ‘𝐴) ∧ 𝑥 ≈ (ℵ‘𝐴))} → ((ℵ‘suc 𝐴) ≈ (2𝑜𝑚 (ℵ‘𝐴)) ↔ (ℵ‘suc 𝐴) ≈ {𝑥 ∣ (𝑥 ⊆ (ℵ‘𝐴) ∧ 𝑥 ≈ (ℵ‘𝐴))}))
31, 2syl 17 . 2 (𝐴 ∈ On → ((ℵ‘suc 𝐴) ≈ (2𝑜𝑚 (ℵ‘𝐴)) ↔ (ℵ‘suc 𝐴) ≈ {𝑥 ∣ (𝑥 ⊆ (ℵ‘𝐴) ∧ 𝑥 ≈ (ℵ‘𝐴))}))
43bicomd 208 1 (𝐴 ∈ On → ((ℵ‘suc 𝐴) ≈ {𝑥 ∣ (𝑥 ⊆ (ℵ‘𝐴) ∧ 𝑥 ≈ (ℵ‘𝐴))} ↔ (ℵ‘suc 𝐴) ≈ (2𝑜𝑚 (ℵ‘𝐴))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 191  wa 378  wcel 1937  {cab 2491  wss 3426   class class class wbr 4434  Oncon0 5474  suc csuc 5476  cfv 5633  (class class class)co 6363  2𝑜c2o 7253  𝑚 cmap 7555  cen 7649  cale 8455
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1698  ax-4 1711  ax-5 1789  ax-6 1836  ax-7 1883  ax-8 1939  ax-9 1946  ax-10 1965  ax-11 1970  ax-12 1983  ax-13 2137  ax-ext 2485  ax-rep 4548  ax-sep 4558  ax-nul 4567  ax-pow 4619  ax-pr 4680  ax-un 6659  ax-inf2 8231  ax-ac2 8978
This theorem depends on definitions:  df-bi 192  df-or 379  df-an 380  df-3or 1022  df-3an 1023  df-tru 1471  df-ex 1693  df-nf 1697  df-sb 1829  df-eu 2357  df-mo 2358  df-clab 2492  df-cleq 2498  df-clel 2501  df-nfc 2635  df-ne 2677  df-ral 2796  df-rex 2797  df-reu 2798  df-rmo 2799  df-rab 2800  df-v 3068  df-sbc 3292  df-csb 3386  df-dif 3429  df-un 3431  df-in 3433  df-ss 3440  df-pss 3442  df-nul 3758  df-if 3909  df-pw 3980  df-sn 3996  df-pr 3998  df-tp 4000  df-op 4002  df-uni 4229  df-int 4265  df-iun 4309  df-br 4435  df-opab 4494  df-mpt 4495  df-tr 4531  df-eprel 4791  df-id 4795  df-po 4801  df-so 4802  df-fr 4839  df-se 4840  df-we 4841  df-xp 4886  df-rel 4887  df-cnv 4888  df-co 4889  df-dm 4890  df-rn 4891  df-res 4892  df-ima 4893  df-pred 5431  df-ord 5477  df-on 5478  df-lim 5479  df-suc 5480  df-iota 5597  df-fun 5635  df-fn 5636  df-f 5637  df-f1 5638  df-fo 5639  df-f1o 5640  df-fv 5641  df-isom 5642  df-riota 6325  df-ov 6366  df-oprab 6367  df-mpt2 6368  df-om 6770  df-1st 6870  df-2nd 6871  df-wrecs 7105  df-recs 7167  df-rdg 7205  df-1o 7259  df-2o 7260  df-oadd 7263  df-er 7440  df-map 7557  df-en 7653  df-dom 7654  df-sdom 7655  df-fin 7656  df-oi 8108  df-har 8156  df-card 8458  df-aleph 8459  df-acn 8461  df-ac 8632
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator