Theorem canth 7362

Description: No set 𝐴 is equinumerous to its power set (Cantor's theorem), i.e., no function can map 𝐴 onto its power set. Compare Theorem 6B(b) of [Enderton] p. 132. For the equinumerosity version, see canth2 9130. Note that 𝐴 must be a set: this theorem does not hold when 𝐴 is too large to be a set; see ncanth 7363 for a counterexample. (Use nex 1803 if you want the form ¬ ∃𝑓𝑓:𝐴–onto→𝒫 𝐴.) (Contributed by NM, 7-Aug-1994.) (Proof shortened by Mario Carneiro, 7-Jun-2016.)

Hypothesis

Ref	Expression
canth.1	⊢ 𝐴 ∈ V

Assertion

Ref	Expression
canth	⊢ ¬ 𝐹:𝐴–onto→𝒫 𝐴

Proof of Theorem canth

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		canth.1	. . . 4 ⊢ 𝐴 ∈ V
2		ssrab2 4078	. . . 4 ⊢ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ (𝐹‘𝑥)} ⊆ 𝐴
3	1, 2	elpwi2 5347	. . 3 ⊢ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ (𝐹‘𝑥)} ∈ 𝒫 𝐴
4		forn 6809	. . 3 ⊢ (𝐹:𝐴–onto→𝒫 𝐴 → ran 𝐹 = 𝒫 𝐴)
5	3, 4	eleqtrrid 2841	. 2 ⊢ (𝐹:𝐴–onto→𝒫 𝐴 → {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ (𝐹‘𝑥)} ∈ ran 𝐹)
6		id 22	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → 𝑥 = 𝑦)
7		fveq2 6892	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (𝐹‘𝑥) = (𝐹‘𝑦))
8	6, 7	eleq12d 2828	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ (𝐹‘𝑥) ↔ 𝑦 ∈ (𝐹‘𝑦)))
9	8	notbid 318	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → (¬ 𝑥 ∈ (𝐹‘𝑥) ↔ ¬ 𝑦 ∈ (𝐹‘𝑦)))
10	9	elrab 3684	. . . . . . 7 ⊢ (𝑦 ∈ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ (𝐹‘𝑥)} ↔ (𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ (𝐹‘𝑦)))
11	10	baibr 538	. . . . . 6 ⊢ (𝑦 ∈ 𝐴 → (¬ 𝑦 ∈ (𝐹‘𝑦) ↔ 𝑦 ∈ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ (𝐹‘𝑥)}))
12		nbbn 385	. . . . . 6 ⊢ ((¬ 𝑦 ∈ (𝐹‘𝑦) ↔ 𝑦 ∈ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ (𝐹‘𝑥)}) ↔ ¬ (𝑦 ∈ (𝐹‘𝑦) ↔ 𝑦 ∈ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ (𝐹‘𝑥)}))
13	11, 12	sylib 217	. . . . 5 ⊢ (𝑦 ∈ 𝐴 → ¬ (𝑦 ∈ (𝐹‘𝑦) ↔ 𝑦 ∈ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ (𝐹‘𝑥)}))
14		eleq2 2823	. . . . 5 ⊢ ((𝐹‘𝑦) = {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ (𝐹‘𝑥)} → (𝑦 ∈ (𝐹‘𝑦) ↔ 𝑦 ∈ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ (𝐹‘𝑥)}))
15	13, 14	nsyl 140	. . . 4 ⊢ (𝑦 ∈ 𝐴 → ¬ (𝐹‘𝑦) = {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ (𝐹‘𝑥)})
16	15	nrex 3075	. . 3 ⊢ ¬ ∃𝑦 ∈ 𝐴 (𝐹‘𝑦) = {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ (𝐹‘𝑥)}
17		fofn 6808	. . . 4 ⊢ (𝐹:𝐴–onto→𝒫 𝐴 → 𝐹 Fn 𝐴)
18		fvelrnb 6953	. . . 4 ⊢ (𝐹 Fn 𝐴 → ({𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ (𝐹‘𝑥)} ∈ ran 𝐹 ↔ ∃𝑦 ∈ 𝐴 (𝐹‘𝑦) = {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ (𝐹‘𝑥)}))
19	17, 18	syl 17	. . 3 ⊢ (𝐹:𝐴–onto→𝒫 𝐴 → ({𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ (𝐹‘𝑥)} ∈ ran 𝐹 ↔ ∃𝑦 ∈ 𝐴 (𝐹‘𝑦) = {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ (𝐹‘𝑥)}))
20	16, 19	mtbiri 327	. 2 ⊢ (𝐹:𝐴–onto→𝒫 𝐴 → ¬ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ (𝐹‘𝑥)} ∈ ran 𝐹)
21	5, 20	pm2.65i 193	1 ⊢ ¬ 𝐹:𝐴–onto→𝒫 𝐴

Syntax hints:  ¬ wn 3   ↔ wb 205   = wceq 1542   ∈ wcel 2107  ∃wrex 3071  {crab 3433  Vcvv 3475  𝒫 cpw 4603  ran crn 5678   Fn wfn 6539  –onto→wfo 6542  ‘cfv 6544

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-sep 5300  ax-nul 5307  ax-pr 5428

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-rab 3434  df-v 3477  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-br 5150  df-opab 5212  df-mpt 5233  df-id 5575  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-iota 6496  df-fun 6546  df-fn 6547  df-f 6548  df-fo 6550  df-fv 6552

This theorem is referenced by:  canth2  9130  canthwdom  9574