Theorem r1pw 9813

Description: A stronger property of 𝑅₁ than rankpw 9811. The latter merely proves that 𝑅₁ of the successor is a power set, but here we prove that if 𝐴 is in the cumulative hierarchy, then 𝒫 𝐴 is in the cumulative hierarchy of the successor. (Contributed by Raph Levien, 29-May-2004.) (Revised by Mario Carneiro, 17-Nov-2014.)

Assertion

Ref	Expression
r1pw	⊢ (𝐵 ∈ On → (𝐴 ∈ (𝑅1‘𝐵) ↔ 𝒫 𝐴 ∈ (𝑅1‘suc 𝐵)))

Proof of Theorem r1pw

Step	Hyp	Ref	Expression
1		rankpwi 9791	. . . . . 6 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → (rank‘𝒫 𝐴) = suc (rank‘𝐴))
2	1	eleq1d 2848	. . . . 5 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → ((rank‘𝒫 𝐴) ∈ suc 𝐵 ↔ suc (rank‘𝐴) ∈ suc 𝐵))
3		eloni 6370	. . . . . . 7 ⊢ (𝐵 ∈ On → Ord 𝐵)
4		ordsucelsuc 7814	. . . . . . 7 ⊢ (Ord 𝐵 → ((rank‘𝐴) ∈ 𝐵 ↔ suc (rank‘𝐴) ∈ suc 𝐵))
5	3, 4	syl 18	. . . . . 6 ⊢ (𝐵 ∈ On → ((rank‘𝐴) ∈ 𝐵 ↔ suc (rank‘𝐴) ∈ suc 𝐵))
6	5	bicomd 226	. . . . 5 ⊢ (𝐵 ∈ On → (suc (rank‘𝐴) ∈ suc 𝐵 ↔ (rank‘𝐴) ∈ 𝐵))
7	2, 6	sylan9bb 518	. . . 4 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ On) → ((rank‘𝒫 𝐴) ∈ suc 𝐵 ↔ (rank‘𝐴) ∈ 𝐵))
8		pwwf 9775	. . . . . 6 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) ↔ 𝒫 𝐴 ∈ ∪ (𝑅1 “ On))
9	8	biimpi 219	. . . . 5 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → 𝒫 𝐴 ∈ ∪ (𝑅1 “ On))
10		onsuc 7805	. . . . . 6 ⊢ (𝐵 ∈ On → suc 𝐵 ∈ On)
11		r1fnon 9735	. . . . . . 7 ⊢ 𝑅1 Fn On
12	11	fndmi 6639	. . . . . 6 ⊢ dom 𝑅1 = On
13	10, 12	eleqtrrdi 2874	. . . . 5 ⊢ (𝐵 ∈ On → suc 𝐵 ∈ dom 𝑅1)
14		rankr1ag 9770	. . . . 5 ⊢ ((𝒫 𝐴 ∈ ∪ (𝑅1 “ On) ∧ suc 𝐵 ∈ dom 𝑅1) → (𝒫 𝐴 ∈ (𝑅1‘suc 𝐵) ↔ (rank‘𝒫 𝐴) ∈ suc 𝐵))
15	9, 13, 14	syl2an 607	. . . 4 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ On) → (𝒫 𝐴 ∈ (𝑅1‘suc 𝐵) ↔ (rank‘𝒫 𝐴) ∈ suc 𝐵))
16	12	eleq2i 2855	. . . . 5 ⊢ (𝐵 ∈ dom 𝑅1 ↔ 𝐵 ∈ On)
17		rankr1ag 9770	. . . . 5 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ dom 𝑅1) → (𝐴 ∈ (𝑅1‘𝐵) ↔ (rank‘𝐴) ∈ 𝐵))
18	16, 17	sylan2br 606	. . . 4 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ On) → (𝐴 ∈ (𝑅1‘𝐵) ↔ (rank‘𝐴) ∈ 𝐵))
19	7, 15, 18	3bitr4rd 315	. . 3 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ On) → (𝐴 ∈ (𝑅1‘𝐵) ↔ 𝒫 𝐴 ∈ (𝑅1‘suc 𝐵)))
20	19	ex 417	. 2 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → (𝐵 ∈ On → (𝐴 ∈ (𝑅1‘𝐵) ↔ 𝒫 𝐴 ∈ (𝑅1‘suc 𝐵))))
21		r1elwf 9764	. . . 4 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐴 ∈ ∪ (𝑅1 “ On))
22		r1elwf 9764	. . . . . 6 ⊢ (𝒫 𝐴 ∈ (𝑅1‘suc 𝐵) → 𝒫 𝐴 ∈ ∪ (𝑅1 “ On))
23		r1elssi 9773	. . . . . 6 ⊢ (𝒫 𝐴 ∈ ∪ (𝑅1 “ On) → 𝒫 𝐴 ⊆ ∪ (𝑅1 “ On))
24	22, 23	syl 18	. . . . 5 ⊢ (𝒫 𝐴 ∈ (𝑅1‘suc 𝐵) → 𝒫 𝐴 ⊆ ∪ (𝑅1 “ On))
25		ssid 3959	. . . . . 6 ⊢ 𝐴 ⊆ 𝐴
26		pwexr 7760	. . . . . . 7 ⊢ (𝒫 𝐴 ∈ (𝑅1‘suc 𝐵) → 𝐴 ∈ V)
27		elpwg 4565	. . . . . . 7 ⊢ (𝐴 ∈ V → (𝐴 ∈ 𝒫 𝐴 ↔ 𝐴 ⊆ 𝐴))
28	26, 27	syl 18	. . . . . 6 ⊢ (𝒫 𝐴 ∈ (𝑅1‘suc 𝐵) → (𝐴 ∈ 𝒫 𝐴 ↔ 𝐴 ⊆ 𝐴))
29	25, 28	mpbiri 261	. . . . 5 ⊢ (𝒫 𝐴 ∈ (𝑅1‘suc 𝐵) → 𝐴 ∈ 𝒫 𝐴)
30	24, 29	sseldd 3938	. . . 4 ⊢ (𝒫 𝐴 ∈ (𝑅1‘suc 𝐵) → 𝐴 ∈ ∪ (𝑅1 “ On))
31	21, 30	pm5.21ni 380	. . 3 ⊢ (¬ 𝐴 ∈ ∪ (𝑅1 “ On) → (𝐴 ∈ (𝑅1‘𝐵) ↔ 𝒫 𝐴 ∈ (𝑅1‘suc 𝐵)))
32	31	a1d 26	. 2 ⊢ (¬ 𝐴 ∈ ∪ (𝑅1 “ On) → (𝐵 ∈ On → (𝐴 ∈ (𝑅1‘𝐵) ↔ 𝒫 𝐴 ∈ (𝑅1‘suc 𝐵))))
33	20, 32	pm2.61i 184	1 ⊢ (𝐵 ∈ On → (𝐴 ∈ (𝑅1‘𝐵) ↔ 𝒫 𝐴 ∈ (𝑅1‘suc 𝐵)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   ∈ wcel 2143  Vcvv 3455   ⊆ wss 3905  𝒫 cpw 4562  ∪ cuni 4872  dom cdm 5661   “ cima 5664  Ord word 6359  Oncon0 6360  suc csuc 6362  ‘cfv 6536  𝑅₁cr1 9730  rankcrnk 9731

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-int 4913  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-om 7859  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-r1 9732  df-rank 9733

This theorem is referenced by:  inatsk  10758