Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > r1pwALT | Structured version Visualization version GIF version |
Description: Alternate shorter proof of r1pw 8708 based on the additional axioms ax-reg 8497 and ax-inf2 8538. (Contributed by Raph Levien, 29-May-2004.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
r1pwALT | ⊢ (𝐵 ∈ On → (𝐴 ∈ (𝑅1‘𝐵) ↔ 𝒫 𝐴 ∈ (𝑅1‘suc 𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eleq1 2689 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ (𝑅1‘𝐵) ↔ 𝐴 ∈ (𝑅1‘𝐵))) | |
2 | pweq 4161 | . . . . . 6 ⊢ (𝑥 = 𝐴 → 𝒫 𝑥 = 𝒫 𝐴) | |
3 | 2 | eleq1d 2686 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝒫 𝑥 ∈ (𝑅1‘suc 𝐵) ↔ 𝒫 𝐴 ∈ (𝑅1‘suc 𝐵))) |
4 | 1, 3 | bibi12d 335 | . . . 4 ⊢ (𝑥 = 𝐴 → ((𝑥 ∈ (𝑅1‘𝐵) ↔ 𝒫 𝑥 ∈ (𝑅1‘suc 𝐵)) ↔ (𝐴 ∈ (𝑅1‘𝐵) ↔ 𝒫 𝐴 ∈ (𝑅1‘suc 𝐵)))) |
5 | 4 | imbi2d 330 | . . 3 ⊢ (𝑥 = 𝐴 → ((𝐵 ∈ On → (𝑥 ∈ (𝑅1‘𝐵) ↔ 𝒫 𝑥 ∈ (𝑅1‘suc 𝐵))) ↔ (𝐵 ∈ On → (𝐴 ∈ (𝑅1‘𝐵) ↔ 𝒫 𝐴 ∈ (𝑅1‘suc 𝐵))))) |
6 | vex 3203 | . . . . . . 7 ⊢ 𝑥 ∈ V | |
7 | 6 | rankr1a 8699 | . . . . . 6 ⊢ (𝐵 ∈ On → (𝑥 ∈ (𝑅1‘𝐵) ↔ (rank‘𝑥) ∈ 𝐵)) |
8 | eloni 5733 | . . . . . . 7 ⊢ (𝐵 ∈ On → Ord 𝐵) | |
9 | ordsucelsuc 7022 | . . . . . . 7 ⊢ (Ord 𝐵 → ((rank‘𝑥) ∈ 𝐵 ↔ suc (rank‘𝑥) ∈ suc 𝐵)) | |
10 | 8, 9 | syl 17 | . . . . . 6 ⊢ (𝐵 ∈ On → ((rank‘𝑥) ∈ 𝐵 ↔ suc (rank‘𝑥) ∈ suc 𝐵)) |
11 | 7, 10 | bitrd 268 | . . . . 5 ⊢ (𝐵 ∈ On → (𝑥 ∈ (𝑅1‘𝐵) ↔ suc (rank‘𝑥) ∈ suc 𝐵)) |
12 | 6 | rankpw 8706 | . . . . . 6 ⊢ (rank‘𝒫 𝑥) = suc (rank‘𝑥) |
13 | 12 | eleq1i 2692 | . . . . 5 ⊢ ((rank‘𝒫 𝑥) ∈ suc 𝐵 ↔ suc (rank‘𝑥) ∈ suc 𝐵) |
14 | 11, 13 | syl6bbr 278 | . . . 4 ⊢ (𝐵 ∈ On → (𝑥 ∈ (𝑅1‘𝐵) ↔ (rank‘𝒫 𝑥) ∈ suc 𝐵)) |
15 | suceloni 7013 | . . . . 5 ⊢ (𝐵 ∈ On → suc 𝐵 ∈ On) | |
16 | 6 | pwex 4848 | . . . . . 6 ⊢ 𝒫 𝑥 ∈ V |
17 | 16 | rankr1a 8699 | . . . . 5 ⊢ (suc 𝐵 ∈ On → (𝒫 𝑥 ∈ (𝑅1‘suc 𝐵) ↔ (rank‘𝒫 𝑥) ∈ suc 𝐵)) |
18 | 15, 17 | syl 17 | . . . 4 ⊢ (𝐵 ∈ On → (𝒫 𝑥 ∈ (𝑅1‘suc 𝐵) ↔ (rank‘𝒫 𝑥) ∈ suc 𝐵)) |
19 | 14, 18 | bitr4d 271 | . . 3 ⊢ (𝐵 ∈ On → (𝑥 ∈ (𝑅1‘𝐵) ↔ 𝒫 𝑥 ∈ (𝑅1‘suc 𝐵))) |
20 | 5, 19 | vtoclg 3266 | . 2 ⊢ (𝐴 ∈ V → (𝐵 ∈ On → (𝐴 ∈ (𝑅1‘𝐵) ↔ 𝒫 𝐴 ∈ (𝑅1‘suc 𝐵)))) |
21 | elex 3212 | . . . 4 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐴 ∈ V) | |
22 | elex 3212 | . . . . 5 ⊢ (𝒫 𝐴 ∈ (𝑅1‘suc 𝐵) → 𝒫 𝐴 ∈ V) | |
23 | pwexb 6975 | . . . . 5 ⊢ (𝐴 ∈ V ↔ 𝒫 𝐴 ∈ V) | |
24 | 22, 23 | sylibr 224 | . . . 4 ⊢ (𝒫 𝐴 ∈ (𝑅1‘suc 𝐵) → 𝐴 ∈ V) |
25 | 21, 24 | pm5.21ni 367 | . . 3 ⊢ (¬ 𝐴 ∈ V → (𝐴 ∈ (𝑅1‘𝐵) ↔ 𝒫 𝐴 ∈ (𝑅1‘suc 𝐵))) |
26 | 25 | a1d 25 | . 2 ⊢ (¬ 𝐴 ∈ V → (𝐵 ∈ On → (𝐴 ∈ (𝑅1‘𝐵) ↔ 𝒫 𝐴 ∈ (𝑅1‘suc 𝐵)))) |
27 | 20, 26 | pm2.61i 176 | 1 ⊢ (𝐵 ∈ On → (𝐴 ∈ (𝑅1‘𝐵) ↔ 𝒫 𝐴 ∈ (𝑅1‘suc 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 196 = wceq 1483 ∈ wcel 1990 Vcvv 3200 𝒫 cpw 4158 Ord word 5722 Oncon0 5723 suc csuc 5725 ‘cfv 5888 𝑅1cr1 8625 rankcrnk 8626 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-reg 8497 ax-inf2 8538 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-reu 2919 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-om 7066 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-r1 8627 df-rank 8628 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |