Theorem gch-kn 7547

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 7546 to the successor aleph using enen2 4467.

Assertion

Ref	Expression
gch-kn	|- (A e. On -> ((aleph` suc A) ~~ {x | (x (_ (aleph` A) /\ x ~~ (aleph` A))} <-> (aleph` suc A) ~~ (2o ^m (aleph` A))))

Distinct variable group:   x,A

Proof of Theorem gch-kn

Step	Hyp	Ref	Expression
1		alephexp2 7546	. . 3 |- (A e. On -> (2o ^m (aleph` A)) ~~ {x | (x (_ (aleph` A) /\ x ~~ (aleph` A))})
2		df-pw 2399	. . . . . 6 |- P~(aleph` A) = {x | x (_ (aleph` A)}
3		fvex 3727	. . . . . . 7 |- (aleph` A) e. V
4	3	pwex 2741	. . . . . 6 |- P~(aleph` A) e. V
5	2, 4	eqeltrr 1543	. . . . 5 |- {x | x (_ (aleph` A)} e. V
6		pm3.26 319	. . . . . 6 |- ((x (_ (aleph` A) /\ x ~~ (aleph` A)) -> x (_ (aleph` A))
7	6	ss2abi 2117	. . . . 5 |- {x | (x (_ (aleph` A) /\ x ~~ (aleph` A))} (_ {x | x (_ (aleph` A)}
8	5, 7	ssexi 2716	. . . 4 |- {x | (x (_ (aleph` A) /\ x ~~ (aleph` A))} e. V
9		enen2 4467	. . . 4 |- (({x | (x (_ (aleph` A) /\ x ~~ (aleph` A))} e. V /\ (2o ^m (aleph` A)) ~~ {x | (x (_ (aleph` A) /\ x ~~ (aleph` A))}) -> ((aleph` suc A) ~~ (2o ^m (aleph` A)) <-> (aleph` suc A) ~~ {x | (x (_ (aleph` A) /\ x ~~ (aleph` A))}))
10	8, 9	mpan 694	. . 3 |- ((2o ^m (aleph` A)) ~~ {x | (x (_ (aleph` A) /\ x ~~ (aleph` A))} -> ((aleph` suc A) ~~ (2o ^m (aleph` A)) <-> (aleph` suc A) ~~ {x | (x (_ (aleph` A) /\ x ~~ (aleph` A))}))
11	1, 10	syl 10	. 2 |- (A e. On -> ((aleph` suc A) ~~ (2o ^m (aleph` A)) <-> (aleph` suc A) ~~ {x | (x (_ (aleph` A) /\ x ~~ (aleph` A))}))
12	11	bicomd 520	1 |- (A e. On -> ((aleph` suc A) ~~ {x | (x (_ (aleph` A) /\ x ~~ (aleph` A))} <-> (aleph` suc A) ~~ (2o ^m (aleph` A))))

Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223   e. wcel 957  {cab 1462  Vcvv 1808   (_ wss 2044  P~cpw 2398   class class class wbr 2615  Oncon0 2944  suc csuc 2946  ` cfv 3178  (class class class)co 3958  2oc2o 4122   ^m cm 4315   ~~ cen 4357  alephcale 4797

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 961  ax-gen 962  ax-8 963  ax-9 964  ax-10 965  ax-11 966  ax-12 967  ax-13 968  ax-14 969  ax-17 970  ax-4 972  ax-5o 974  ax-6o 977  ax-9o 1122  ax-10o 1139  ax-16 1209  ax-11o 1217  ax-ext 1458  ax-rep 2689  ax-sep 2699  ax-nul 2706  ax-pow 2738  ax-pr 2775  ax-un 2862  ax-reg 4576  ax-inf2 4608  ax-ac 4727

This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 775  df-3an 776  df-ex 980  df-sb 1171  df-eu 1381  df-mo 1382  df-clab 1463  df-cleq 1468  df-clel 1471  df-ne 1585  df-nel 1586  df-ral 1647  df-rex 1648  df-reu 1649  df-rab 1650  df-v 1809  df-sbc 1939  df-csb 1999  df-dif 2046  df-un 2047  df-in 2048  df-ss 2050  df-pss 2052  df-nul 2278  df-if 2359  df-pw 2399  df-sn 2409  df-pr 2410  df-tp 2412  df-op 2413  df-uni 2500  df-int 2530  df-iun 2564  df-br 2616  df-opab 2663  df-tr 2677  df-eprel 2828  df-id 2831  df-po 2836  df-so 2846  df-fr 2913  df-we 2930  df-ord 2947  df-on 2948  df-lim 2949  df-suc 2950  df-om 3128  df-xp 3180  df-rel 3181  df-cnv 3182  df-co 3183  df-dm 3184  df-rn 3185  df-res 3186  df-ima 3187  df-fun 3188  df-fn 3189  df-f 3190  df-f1 3191  df-fo 3192  df-f1o 3193  df-fv 3194  df-iso 3195  df-rdg 3927  df-opr 3960  df-oprab 3961  df-1st 4072  df-2nd 4073  df-1o 4126  df-2o 4127  df-oadd 4128  df-omul 4129  df-er 4254  df-ec 4256  df-qs 4259  df-map 4317  df-en 4360  df-dom 4361  df-sdom 4362  df-card 4799  df-aleph 4800  df-ni 4983  df-pli 4984  df-mi 4985  df-lti 4986  df-plpq 5018  df-mpq 5019  df-enq 5020  df-nq 5021  df-plq 5022  df-mq 5023  df-rq 5024  df-ltq 5025  df-1q 5026  df-np 5069  df-1p 5070  df-plp 5071  df-mp 5072  df-ltp 5073  df-plpr 5147  df-mpr 5148  df-enr 5149  df-nr 5150  df-plr 5151  df-mr 5152  df-ltr 5153  df-0r 5154  df-1r 5155  df-m1r 5156  df-c 5223  df-0 5224  df-1 5225  df-i 5226  df-r 5227  df-plus 5228  df-mul 5229  df-lt 5230  df-sub 5339  df-neg 5341  df-pnf 5470  df-mnf 5471  df-xr 5472  df-ltxr 5473  df-le 5474  df-n 5883  df-2 5927  df-n0 6057  df-z 6093  df-seq1 6258  df-exp 6514

Copyright terms: Public domain