Theorem canthp1 10778

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 9277	. . . . 5 ⊢ 1o ≺ 2o
2		sdomdom 9045	. . . . 5 ⊢ (1o ≺ 2o → 1o ≼ 2o)
3	1, 2	ax-mp 5	. . . 4 ⊢ 1o ≼ 2o
4		relsdom 9018	. . . . 5 ⊢ Rel ≺
5	4	brrelex2i 5715	. . . 4 ⊢ (1o ≺ 𝐴 → 𝐴 ∈ V)
6		djudom2 10301	. . . 4 ⊢ ((1o ≼ 2o ∧ 𝐴 ∈ V) → (𝐴 ⊔ 1o) ≼ (𝐴 ⊔ 2o))
7	3, 5, 6	sylancr 599	. . 3 ⊢ (1o ≺ 𝐴 → (𝐴 ⊔ 1o) ≼ (𝐴 ⊔ 2o))
8		canthp1lem1 10776	. . 3 ⊢ (1o ≺ 𝐴 → (𝐴 ⊔ 2o) ≼ 𝒫 𝐴)
9		domtr 9072	. . 3 ⊢ (((𝐴 ⊔ 1o) ≼ (𝐴 ⊔ 2o) ∧ (𝐴 ⊔ 2o) ≼ 𝒫 𝐴) → (𝐴 ⊔ 1o) ≼ 𝒫 𝐴)
10	7, 8, 9	syl2anc 596	. 2 ⊢ (1o ≺ 𝐴 → (𝐴 ⊔ 1o) ≼ 𝒫 𝐴)
11		fal 1584	. . 3 ⊢ ¬ ⊥
12		ensym 9068	. . . . 5 ⊢ ((𝐴 ⊔ 1o) ≈ 𝒫 𝐴 → 𝒫 𝐴 ≈ (𝐴 ⊔ 1o))
13		bren 9021	. . . . 5 ⊢ (𝒫 𝐴 ≈ (𝐴 ⊔ 1o) ↔ ∃𝑓 𝑓:𝒫 𝐴⟶1-1onto(𝐴 ⊔ 1o))
14	12, 13	sylib 221	. . . 4 ⊢ ((𝐴 ⊔ 1o) ≈ 𝒫 𝐴 → ∃𝑓 𝑓:𝒫 𝐴⟶1-1onto(𝐴 ⊔ 1o))
15		f1of 6854	. . . . . . . . . 10 ⊢ (𝑓:𝒫 𝐴⟶1-1onto(𝐴 ⊔ 1o) → 𝑓:𝒫 𝐴⟶(𝐴 ⊔ 1o))
16		pwidg 4581	. . . . . . . . . . 11 ⊢ (𝐴 ∈ V → 𝐴 ∈ 𝒫 𝐴)
17	5, 16	syl 18	. . . . . . . . . 10 ⊢ (1o ≺ 𝐴 → 𝐴 ∈ 𝒫 𝐴)
18		ffvelcdm 7113	. . . . . . . . . 10 ⊢ ((𝑓:𝒫 𝐴⟶(𝐴 ⊔ 1o) ∧ 𝐴 ∈ 𝒫 𝐴) → (𝑓‘𝐴) ∈ (𝐴 ⊔ 1o))
19	15, 17, 18	syl2anr 609	. . . . . . . . 9 ⊢ ((1o ≺ 𝐴 ∧ 𝑓:𝒫 𝐴⟶1-1onto(𝐴 ⊔ 1o)) → (𝑓‘𝐴) ∈ (𝐴 ⊔ 1o))
20		dju1dif 10290	. . . . . . . . 9 ⊢ ((𝐴 ∈ V ∧ (𝑓‘𝐴) ∈ (𝐴 ⊔ 1o)) → ((𝐴 ⊔ 1o) ∖ {(𝑓‘𝐴)}) ≈ 𝐴)
21	5, 19, 20	syl2an2r 698	. . . . . . . 8 ⊢ ((1o ≺ 𝐴 ∧ 𝑓:𝒫 𝐴⟶1-1onto(𝐴 ⊔ 1o)) → ((𝐴 ⊔ 1o) ∖ {(𝑓‘𝐴)}) ≈ 𝐴)
22		bren 9021	. . . . . . . 8 ⊢ (((𝐴 ⊔ 1o) ∖ {(𝑓‘𝐴)}) ≈ 𝐴 ↔ ∃𝑔 𝑔:((𝐴 ⊔ 1o) ∖ {(𝑓‘𝐴)})⟶1-1onto𝐴)
23	21, 22	sylib 221	. . . . . . 7 ⊢ ((1o ≺ 𝐴 ∧ 𝑓:𝒫 𝐴⟶1-1onto(𝐴 ⊔ 1o)) → ∃𝑔 𝑔:((𝐴 ⊔ 1o) ∖ {(𝑓‘𝐴)})⟶1-1onto𝐴)
24		simpll 779	. . . . . . . . 9 ⊢ (((1o ≺ 𝐴 ∧ 𝑓:𝒫 𝐴⟶1-1onto(𝐴 ⊔ 1o)) ∧ 𝑔:((𝐴 ⊔ 1o) ∖ {(𝑓‘𝐴)})⟶1-1onto𝐴) → 1o ≺ 𝐴)
25		simplr 781	. . . . . . . . 9 ⊢ (((1o ≺ 𝐴 ∧ 𝑓:𝒫 𝐴⟶1-1onto(𝐴 ⊔ 1o)) ∧ 𝑔:((𝐴 ⊔ 1o) ∖ {(𝑓‘𝐴)})⟶1-1onto𝐴) → 𝑓:𝒫 𝐴⟶1-1onto(𝐴 ⊔ 1o))
26		simpr 490	. . . . . . . . 9 ⊢ (((1o ≺ 𝐴 ∧ 𝑓:𝒫 𝐴⟶1-1onto(𝐴 ⊔ 1o)) ∧ 𝑔:((𝐴 ⊔ 1o) ∖ {(𝑓‘𝐴)})⟶1-1onto𝐴) → 𝑔:((𝐴 ⊔ 1o) ∖ {(𝑓‘𝐴)})⟶1-1onto𝐴)
27		eqeq1 2767	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑥 → (𝑤 = 𝐴 ↔ 𝑥 = 𝐴))
28		id 23	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑥 → 𝑤 = 𝑥)
29	27, 28	ifbieq2d 4512	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑥 → if(𝑤 = 𝐴, ∅, 𝑤) = if(𝑥 = 𝐴, ∅, 𝑥))
30	29	cbvmptv 5215	. . . . . . . . . 10 ⊢ (𝑤 ∈ 𝒫 𝐴 ↦ if(𝑤 = 𝐴, ∅, 𝑤)) = (𝑥 ∈ 𝒫 𝐴 ↦ if(𝑥 = 𝐴, ∅, 𝑥))
31	30	coeq2i 5849	. . . . . . . . 9 ⊢ ((𝑔 ∘ 𝑓) ∘ (𝑤 ∈ 𝒫 𝐴 ↦ if(𝑤 = 𝐴, ∅, 𝑤))) = ((𝑔 ∘ 𝑓) ∘ (𝑥 ∈ 𝒫 𝐴 ↦ if(𝑥 = 𝐴, ∅, 𝑥)))
32		eqid 2763	. . . . . . . . . 10 ⊢ {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 (((𝑔 ∘ 𝑓) ∘ (𝑤 ∈ 𝒫 𝐴 ↦ if(𝑤 = 𝐴, ∅, 𝑤)))‘(◡𝑠 “ {𝑧})) = 𝑧))} = {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 (((𝑔 ∘ 𝑓) ∘ (𝑤 ∈ 𝒫 𝐴 ↦ if(𝑤 = 𝐴, ∅, 𝑤)))‘(◡𝑠 “ {𝑧})) = 𝑧))}
33	32	fpwwecbv 10768	. . . . . . . . 9 ⊢ {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 (((𝑔 ∘ 𝑓) ∘ (𝑤 ∈ 𝒫 𝐴 ↦ if(𝑤 = 𝐴, ∅, 𝑤)))‘(◡𝑠 “ {𝑧})) = 𝑧))} = {⟨𝑥, 𝑟⟩ ∣ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 (((𝑔 ∘ 𝑓) ∘ (𝑤 ∈ 𝒫 𝐴 ↦ if(𝑤 = 𝐴, ∅, 𝑤)))‘(◡𝑟 “ {𝑦})) = 𝑦))}
34		eqid 2763	. . . . . . . . 9 ⊢ ∪ dom {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 (((𝑔 ∘ 𝑓) ∘ (𝑤 ∈ 𝒫 𝐴 ↦ if(𝑤 = 𝐴, ∅, 𝑤)))‘(◡𝑠 “ {𝑧})) = 𝑧))} = ∪ dom {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 (((𝑔 ∘ 𝑓) ∘ (𝑤 ∈ 𝒫 𝐴 ↦ if(𝑤 = 𝐴, ∅, 𝑤)))‘(◡𝑠 “ {𝑧})) = 𝑧))}
35	24, 25, 26, 31, 33, 34	canthp1lem2 10777	. . . . . . . 8 ⊢ ¬ ((1o ≺ 𝐴 ∧ 𝑓:𝒫 𝐴⟶1-1onto(𝐴 ⊔ 1o)) ∧ 𝑔:((𝐴 ⊔ 1o) ∖ {(𝑓‘𝐴)})⟶1-1onto𝐴)
36	35	pm2.21i 120	. . . . . . 7 ⊢ (((1o ≺ 𝐴 ∧ 𝑓:𝒫 𝐴⟶1-1onto(𝐴 ⊔ 1o)) ∧ 𝑔:((𝐴 ⊔ 1o) ∖ {(𝑓‘𝐴)})⟶1-1onto𝐴) → ⊥)
37	23, 36	exlimddv 1970	. . . . . 6 ⊢ ((1o ≺ 𝐴 ∧ 𝑓:𝒫 𝐴⟶1-1onto(𝐴 ⊔ 1o)) → ⊥)
38	37	ex 418	. . . . 5 ⊢ (1o ≺ 𝐴 → (𝑓:𝒫 𝐴⟶1-1onto(𝐴 ⊔ 1o) → ⊥))
39	38	exlimdv 1968	. . . 4 ⊢ (1o ≺ 𝐴 → (∃𝑓 𝑓:𝒫 𝐴⟶1-1onto(𝐴 ⊔ 1o) → ⊥))
40	14, 39	syl5 35	. . 3 ⊢ (1o ≺ 𝐴 → ((𝐴 ⊔ 1o) ≈ 𝒫 𝐴 → ⊥))
41	11, 40	mtoi 202	. 2 ⊢ (1o ≺ 𝐴 → ¬ (𝐴 ⊔ 1o) ≈ 𝒫 𝐴)
42		brsdom 9039	. 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 2147  ∀wral 3080  Vcvv 3454   ⊆ wss 3900   ∖ cdif 4048  ∅c0 4281  ifcif 4485  𝒫 cpw 4560  {csn 4588  ∪ cuni 4872   class class class wbr 5108  {copab 5173   ↦ cmpt 5192   We wwe 5610   × cxp 5656  ^◡ccnv 5657  dom cdm 5658   “ cima 5661   ∘ ccom 5662  ⟶wf 6562  ⟶1-1ontowf1o 6565  ‘cfv 6566  1_oc1o 8507  2_oc2o 8508   ≈ cen 9008   ≼ cdom 9009   ≺ csdm 9010   ⊔ cdju 10016

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  ax-inf2 9679

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-tp 4593  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-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-2o 8515  df-er 8755  df-map 8887  df-en 9012  df-dom 9013  df-sdom 9014  df-fin 9015  df-oi 9541  df-dju 10019  df-card 10057

This theorem is used by:  finngch  10779  gchdju1  10780