Theorem canthp1 10654

Description: A slightly stronger form of Cantor's theorem: For 1 < 𝑛, 𝑛 + 1 < 2↑𝑛. Corollary 1.6 of [KanamoriPincus] p. 417. (Contributed by Mario Carneiro, 18-May-2015.)

Assertion

Ref	Expression
canthp1	⊢ (1o ≺ 𝐴 → (𝐴 ⊔ 1o) ≺ 𝒫 𝐴)

Proof of Theorem canthp1

Dummy variables 𝑓 𝑎 𝑔 𝑟 𝑠 𝑤 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		1sdom2 9215	. . . . 5 ⊢ 1o ≺ 2o
2		sdomdom 8983	. . . . 5 ⊢ (1o ≺ 2o → 1o ≼ 2o)
3	1, 2	ax-mp 5	. . . 4 ⊢ 1o ≼ 2o
4		relsdom 8956	. . . . 5 ⊢ Rel ≺
5	4	brrelex2i 5720	. . . 4 ⊢ (1o ≺ 𝐴 → 𝐴 ∈ V)
6		djudom2 10183	. . . 4 ⊢ ((1o ≼ 2o ∧ 𝐴 ∈ V) → (𝐴 ⊔ 1o) ≼ (𝐴 ⊔ 2o))
7	3, 5, 6	sylancr 599	. . 3 ⊢ (1o ≺ 𝐴 → (𝐴 ⊔ 1o) ≼ (𝐴 ⊔ 2o))
8		canthp1lem1 10652	. . 3 ⊢ (1o ≺ 𝐴 → (𝐴 ⊔ 2o) ≼ 𝒫 𝐴)
9		domtr 9010	. . 3 ⊢ (((𝐴 ⊔ 1o) ≼ (𝐴 ⊔ 2o) ∧ (𝐴 ⊔ 2o) ≼ 𝒫 𝐴) → (𝐴 ⊔ 1o) ≼ 𝒫 𝐴)
10	7, 8, 9	syl2anc 596	. 2 ⊢ (1o ≺ 𝐴 → (𝐴 ⊔ 1o) ≼ 𝒫 𝐴)
11		fal 1584	. . 3 ⊢ ¬ ⊥
12		ensym 9006	. . . . 5 ⊢ ((𝐴 ⊔ 1o) ≈ 𝒫 𝐴 → 𝒫 𝐴 ≈ (𝐴 ⊔ 1o))
13		bren 8959	. . . . 5 ⊢ (𝒫 𝐴 ≈ (𝐴 ⊔ 1o) ↔ ∃𝑓 𝑓:𝒫 𝐴–1-1-onto→(𝐴 ⊔ 1o))
14	12, 13	sylib 221	. . . 4 ⊢ ((𝐴 ⊔ 1o) ≈ 𝒫 𝐴 → ∃𝑓 𝑓:𝒫 𝐴–1-1-onto→(𝐴 ⊔ 1o))
15		f1of 6824	. . . . . . . . . 10 ⊢ (𝑓:𝒫 𝐴–1-1-onto→(𝐴 ⊔ 1o) → 𝑓:𝒫 𝐴⟶(𝐴 ⊔ 1o))
16		pwidg 4584	. . . . . . . . . . 11 ⊢ (𝐴 ∈ V → 𝐴 ∈ 𝒫 𝐴)
17	5, 16	syl 18	. . . . . . . . . 10 ⊢ (1o ≺ 𝐴 → 𝐴 ∈ 𝒫 𝐴)
18		ffvelcdm 7080	. . . . . . . . . 10 ⊢ ((𝑓:𝒫 𝐴⟶(𝐴 ⊔ 1o) ∧ 𝐴 ∈ 𝒫 𝐴) → (𝑓‘𝐴) ∈ (𝐴 ⊔ 1o))
19	15, 17, 18	syl2anr 609	. . . . . . . . 9 ⊢ ((1o ≺ 𝐴 ∧ 𝑓:𝒫 𝐴–1-1-onto→(𝐴 ⊔ 1o)) → (𝑓‘𝐴) ∈ (𝐴 ⊔ 1o))
20		dju1dif 10172	. . . . . . . . 9 ⊢ ((𝐴 ∈ V ∧ (𝑓‘𝐴) ∈ (𝐴 ⊔ 1o)) → ((𝐴 ⊔ 1o) ∖ {(𝑓‘𝐴)}) ≈ 𝐴)
21	5, 19, 20	syl2an2r 698	. . . . . . . 8 ⊢ ((1o ≺ 𝐴 ∧ 𝑓:𝒫 𝐴–1-1-onto→(𝐴 ⊔ 1o)) → ((𝐴 ⊔ 1o) ∖ {(𝑓‘𝐴)}) ≈ 𝐴)
22		bren 8959	. . . . . . . 8 ⊢ (((𝐴 ⊔ 1o) ∖ {(𝑓‘𝐴)}) ≈ 𝐴 ↔ ∃𝑔 𝑔:((𝐴 ⊔ 1o) ∖ {(𝑓‘𝐴)})–1-1-onto→𝐴)
23	21, 22	sylib 221	. . . . . . 7 ⊢ ((1o ≺ 𝐴 ∧ 𝑓:𝒫 𝐴–1-1-onto→(𝐴 ⊔ 1o)) → ∃𝑔 𝑔:((𝐴 ⊔ 1o) ∖ {(𝑓‘𝐴)})–1-1-onto→𝐴)
24		simpll 779	. . . . . . . . 9 ⊢ (((1o ≺ 𝐴 ∧ 𝑓:𝒫 𝐴–1-1-onto→(𝐴 ⊔ 1o)) ∧ 𝑔:((𝐴 ⊔ 1o) ∖ {(𝑓‘𝐴)})–1-1-onto→𝐴) → 1o ≺ 𝐴)
25		simplr 781	. . . . . . . . 9 ⊢ (((1o ≺ 𝐴 ∧ 𝑓:𝒫 𝐴–1-1-onto→(𝐴 ⊔ 1o)) ∧ 𝑔:((𝐴 ⊔ 1o) ∖ {(𝑓‘𝐴)})–1-1-onto→𝐴) → 𝑓:𝒫 𝐴–1-1-onto→(𝐴 ⊔ 1o))
26		simpr 490	. . . . . . . . 9 ⊢ (((1o ≺ 𝐴 ∧ 𝑓:𝒫 𝐴–1-1-onto→(𝐴 ⊔ 1o)) ∧ 𝑔:((𝐴 ⊔ 1o) ∖ {(𝑓‘𝐴)})–1-1-onto→𝐴) → 𝑔:((𝐴 ⊔ 1o) ∖ {(𝑓‘𝐴)})–1-1-onto→𝐴)
27		eqeq1 2769	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑥 → (𝑤 = 𝐴 ↔ 𝑥 = 𝐴))
28		id 23	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑥 → 𝑤 = 𝑥)
29	27, 28	ifbieq2d 4516	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑥 → if(𝑤 = 𝐴, ∅, 𝑤) = if(𝑥 = 𝐴, ∅, 𝑥))
30	29	cbvmptv 5217	. . . . . . . . . 10 ⊢ (𝑤 ∈ 𝒫 𝐴 ↦ if(𝑤 = 𝐴, ∅, 𝑤)) = (𝑥 ∈ 𝒫 𝐴 ↦ if(𝑥 = 𝐴, ∅, 𝑥))
31	30	coeq2i 5848	. . . . . . . . 9 ⊢ ((𝑔 ∘ 𝑓) ∘ (𝑤 ∈ 𝒫 𝐴 ↦ if(𝑤 = 𝐴, ∅, 𝑤))) = ((𝑔 ∘ 𝑓) ∘ (𝑥 ∈ 𝒫 𝐴 ↦ if(𝑥 = 𝐴, ∅, 𝑥)))
32		eqid 2765	. . . . . . . . . 10 ⊢ {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 (((𝑔 ∘ 𝑓) ∘ (𝑤 ∈ 𝒫 𝐴 ↦ if(𝑤 = 𝐴, ∅, 𝑤)))‘(◡𝑠 “ {𝑧})) = 𝑧))} = {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 (((𝑔 ∘ 𝑓) ∘ (𝑤 ∈ 𝒫 𝐴 ↦ if(𝑤 = 𝐴, ∅, 𝑤)))‘(◡𝑠 “ {𝑧})) = 𝑧))}
33	32	fpwwecbv 10644	. . . . . . . . 9 ⊢ {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 (((𝑔 ∘ 𝑓) ∘ (𝑤 ∈ 𝒫 𝐴 ↦ if(𝑤 = 𝐴, ∅, 𝑤)))‘(◡𝑠 “ {𝑧})) = 𝑧))} = {⟨𝑥, 𝑟⟩ ∣ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 (((𝑔 ∘ 𝑓) ∘ (𝑤 ∈ 𝒫 𝐴 ↦ if(𝑤 = 𝐴, ∅, 𝑤)))‘(◡𝑟 “ {𝑦})) = 𝑦))}
34		eqid 2765	. . . . . . . . 9 ⊢ ∪ dom {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 (((𝑔 ∘ 𝑓) ∘ (𝑤 ∈ 𝒫 𝐴 ↦ if(𝑤 = 𝐴, ∅, 𝑤)))‘(◡𝑠 “ {𝑧})) = 𝑧))} = ∪ dom {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 (((𝑔 ∘ 𝑓) ∘ (𝑤 ∈ 𝒫 𝐴 ↦ if(𝑤 = 𝐴, ∅, 𝑤)))‘(◡𝑠 “ {𝑧})) = 𝑧))}
35	24, 25, 26, 31, 33, 34	canthp1lem2 10653	. . . . . . . 8 ⊢ ¬ ((1o ≺ 𝐴 ∧ 𝑓:𝒫 𝐴–1-1-onto→(𝐴 ⊔ 1o)) ∧ 𝑔:((𝐴 ⊔ 1o) ∖ {(𝑓‘𝐴)})–1-1-onto→𝐴)
36	35	pm2.21i 120	. . . . . . 7 ⊢ (((1o ≺ 𝐴 ∧ 𝑓:𝒫 𝐴–1-1-onto→(𝐴 ⊔ 1o)) ∧ 𝑔:((𝐴 ⊔ 1o) ∖ {(𝑓‘𝐴)})–1-1-onto→𝐴) → ⊥)
37	23, 36	exlimddv 1968	. . . . . 6 ⊢ ((1o ≺ 𝐴 ∧ 𝑓:𝒫 𝐴–1-1-onto→(𝐴 ⊔ 1o)) → ⊥)
38	37	ex 418	. . . . 5 ⊢ (1o ≺ 𝐴 → (𝑓:𝒫 𝐴–1-1-onto→(𝐴 ⊔ 1o) → ⊥))
39	38	exlimdv 1966	. . . 4 ⊢ (1o ≺ 𝐴 → (∃𝑓 𝑓:𝒫 𝐴–1-1-onto→(𝐴 ⊔ 1o) → ⊥))
40	14, 39	syl5 35	. . 3 ⊢ (1o ≺ 𝐴 → ((𝐴 ⊔ 1o) ≈ 𝒫 𝐴 → ⊥))
41	11, 40	mtoi 202	. 2 ⊢ (1o ≺ 𝐴 → ¬ (𝐴 ⊔ 1o) ≈ 𝒫 𝐴)
42		brsdom 8977	. 2 ⊢ ((𝐴 ⊔ 1o) ≺ 𝒫 𝐴 ↔ ((𝐴 ⊔ 1o) ≼ 𝒫 𝐴 ∧ ¬ (𝐴 ⊔ 1o) ≈ 𝒫 𝐴))
43	10, 41, 42	sylanbrc 595	1 ⊢ (1o ≺ 𝐴 → (𝐴 ⊔ 1o) ≺ 𝒫 𝐴)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570  ⊥wfal 1582  ∃wex 1812   ∈ wcel 2146  ∀wral 3081  Vcvv 3457   ∖ cdif 3903   ⊆ wss 3906  ∅c0 4286  ifcif 4489  𝒫 cpw 4564  {csn 4591  ∪ cuni 4874   class class class wbr 5111  {copab 5175   ↦ cmpt 5194   We wwe 5615   × cxp 5661  ^◡ccnv 5662  dom cdm 5663   “ cima 5666   ∘ ccom 5667  ⟶wf 6536  –1-1-onto→wf1o 6539  ‘cfv 6540  1_oc1o 8452  2_oc2o 8453   ≈ cen 8946   ≼ cdom 8947   ≺ csdm 8948   ⊔ cdju 9900

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742  ax-inf2 9617

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 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-tp 4596  df-op 4598  df-uni 4875  df-int 4915  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-se 5617  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-isom 6549  df-riota 7376  df-ov 7422  df-oprab 7423  df-mpo 7424  df-om 7869  df-1st 7992  df-2nd 7993  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-1o 8459  df-2o 8460  df-er 8700  df-map 8832  df-en 8950  df-dom 8951  df-sdom 8952  df-fin 8953  df-oi 9479  df-dju 9903  df-card 9941

This theorem is used by:  finngch  10655  gchdju1  10656