Theorem canth2g 8670

Description: Cantor's theorem with the sethood requirement expressed as an antecedent. Theorem 23 of [Suppes] p. 97. (Contributed by NM, 7-Nov-2003.)

Assertion

Ref	Expression
canth2g	⊢ (𝐴 ∈ 𝑉 → 𝐴 ≺ 𝒫 𝐴)

Proof of Theorem canth2g

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		pweq 4554	. . 3 ⊢ (𝑥 = 𝐴 → 𝒫 𝑥 = 𝒫 𝐴)
2		breq12 5070	. . 3 ⊢ ((𝑥 = 𝐴 ∧ 𝒫 𝑥 = 𝒫 𝐴) → (𝑥 ≺ 𝒫 𝑥 ↔ 𝐴 ≺ 𝒫 𝐴))
3	1, 2	mpdan 685	. 2 ⊢ (𝑥 = 𝐴 → (𝑥 ≺ 𝒫 𝑥 ↔ 𝐴 ≺ 𝒫 𝐴))
4		vex 3497	. . 3 ⊢ 𝑥 ∈ V
5	4	canth2 8669	. 2 ⊢ 𝑥 ≺ 𝒫 𝑥
6	3, 5	vtoclg 3567	1 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ≺ 𝒫 𝐴)

Syntax hints:   → wi 4   ↔ wb 208   = wceq 1533   ∈ wcel 2110  𝒫 cpw 4538   class class class wbr 5065   ≺ csdm 8507

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5202  ax-nul 5209  ax-pow 5265  ax-pr 5329  ax-un 7460

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4567  df-pr 4569  df-op 4573  df-uni 4838  df-br 5066  df-opab 5128  df-mpt 5146  df-id 5459  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-rn 5565  df-res 5566  df-ima 5567  df-iota 6313  df-fun 6356  df-fn 6357  df-f 6358  df-f1 6359  df-fo 6360  df-f1o 6361  df-fv 6362  df-en 8509  df-dom 8510  df-sdom 8511

This theorem is referenced by:  2pwuninel  8671  2pwne  8672  pwfi  8818  djulepw  9617  isfin32i  9786  fin34  9811  hsmexlem1  9847  canth3  9982  ondomon  9984  gchdomtri  10050  canthp1lem1  10073  canthp1lem2  10074  pwfseqlem5  10084  gchdjuidm  10089  gchxpidm  10090  gchpwdom  10091  gchaclem  10099  gchhar  10100  tsksdom  10177