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 9276 based on the additional axioms ax-reg 9058 and ax-inf2 9106. (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 2902 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ (𝑅1‘𝐵) ↔ 𝐴 ∈ (𝑅1‘𝐵))) | |
2 | pweq 4557 | . . . . . 6 ⊢ (𝑥 = 𝐴 → 𝒫 𝑥 = 𝒫 𝐴) | |
3 | 2 | eleq1d 2899 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝒫 𝑥 ∈ (𝑅1‘suc 𝐵) ↔ 𝒫 𝐴 ∈ (𝑅1‘suc 𝐵))) |
4 | 1, 3 | bibi12d 348 | . . . 4 ⊢ (𝑥 = 𝐴 → ((𝑥 ∈ (𝑅1‘𝐵) ↔ 𝒫 𝑥 ∈ (𝑅1‘suc 𝐵)) ↔ (𝐴 ∈ (𝑅1‘𝐵) ↔ 𝒫 𝐴 ∈ (𝑅1‘suc 𝐵)))) |
5 | 4 | imbi2d 343 | . . 3 ⊢ (𝑥 = 𝐴 → ((𝐵 ∈ On → (𝑥 ∈ (𝑅1‘𝐵) ↔ 𝒫 𝑥 ∈ (𝑅1‘suc 𝐵))) ↔ (𝐵 ∈ On → (𝐴 ∈ (𝑅1‘𝐵) ↔ 𝒫 𝐴 ∈ (𝑅1‘suc 𝐵))))) |
6 | vex 3499 | . . . . . . 7 ⊢ 𝑥 ∈ V | |
7 | 6 | rankr1a 9267 | . . . . . 6 ⊢ (𝐵 ∈ On → (𝑥 ∈ (𝑅1‘𝐵) ↔ (rank‘𝑥) ∈ 𝐵)) |
8 | eloni 6203 | . . . . . . 7 ⊢ (𝐵 ∈ On → Ord 𝐵) | |
9 | ordsucelsuc 7539 | . . . . . . 7 ⊢ (Ord 𝐵 → ((rank‘𝑥) ∈ 𝐵 ↔ suc (rank‘𝑥) ∈ suc 𝐵)) | |
10 | 8, 9 | syl 17 | . . . . . 6 ⊢ (𝐵 ∈ On → ((rank‘𝑥) ∈ 𝐵 ↔ suc (rank‘𝑥) ∈ suc 𝐵)) |
11 | 7, 10 | bitrd 281 | . . . . 5 ⊢ (𝐵 ∈ On → (𝑥 ∈ (𝑅1‘𝐵) ↔ suc (rank‘𝑥) ∈ suc 𝐵)) |
12 | 6 | rankpw 9274 | . . . . . 6 ⊢ (rank‘𝒫 𝑥) = suc (rank‘𝑥) |
13 | 12 | eleq1i 2905 | . . . . 5 ⊢ ((rank‘𝒫 𝑥) ∈ suc 𝐵 ↔ suc (rank‘𝑥) ∈ suc 𝐵) |
14 | 11, 13 | syl6bbr 291 | . . . 4 ⊢ (𝐵 ∈ On → (𝑥 ∈ (𝑅1‘𝐵) ↔ (rank‘𝒫 𝑥) ∈ suc 𝐵)) |
15 | suceloni 7530 | . . . . 5 ⊢ (𝐵 ∈ On → suc 𝐵 ∈ On) | |
16 | 6 | pwex 5283 | . . . . . 6 ⊢ 𝒫 𝑥 ∈ V |
17 | 16 | rankr1a 9267 | . . . . 5 ⊢ (suc 𝐵 ∈ On → (𝒫 𝑥 ∈ (𝑅1‘suc 𝐵) ↔ (rank‘𝒫 𝑥) ∈ suc 𝐵)) |
18 | 15, 17 | syl 17 | . . . 4 ⊢ (𝐵 ∈ On → (𝒫 𝑥 ∈ (𝑅1‘suc 𝐵) ↔ (rank‘𝒫 𝑥) ∈ suc 𝐵)) |
19 | 14, 18 | bitr4d 284 | . . 3 ⊢ (𝐵 ∈ On → (𝑥 ∈ (𝑅1‘𝐵) ↔ 𝒫 𝑥 ∈ (𝑅1‘suc 𝐵))) |
20 | 5, 19 | vtoclg 3569 | . 2 ⊢ (𝐴 ∈ V → (𝐵 ∈ On → (𝐴 ∈ (𝑅1‘𝐵) ↔ 𝒫 𝐴 ∈ (𝑅1‘suc 𝐵)))) |
21 | elex 3514 | . . . 4 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐴 ∈ V) | |
22 | elex 3514 | . . . . 5 ⊢ (𝒫 𝐴 ∈ (𝑅1‘suc 𝐵) → 𝒫 𝐴 ∈ V) | |
23 | pwexb 7490 | . . . . 5 ⊢ (𝐴 ∈ V ↔ 𝒫 𝐴 ∈ V) | |
24 | 22, 23 | sylibr 236 | . . . 4 ⊢ (𝒫 𝐴 ∈ (𝑅1‘suc 𝐵) → 𝐴 ∈ V) |
25 | 21, 24 | pm5.21ni 381 | . . 3 ⊢ (¬ 𝐴 ∈ V → (𝐴 ∈ (𝑅1‘𝐵) ↔ 𝒫 𝐴 ∈ (𝑅1‘suc 𝐵))) |
26 | 25 | a1d 25 | . 2 ⊢ (¬ 𝐴 ∈ V → (𝐵 ∈ On → (𝐴 ∈ (𝑅1‘𝐵) ↔ 𝒫 𝐴 ∈ (𝑅1‘suc 𝐵)))) |
27 | 20, 26 | pm2.61i 184 | 1 ⊢ (𝐵 ∈ On → (𝐴 ∈ (𝑅1‘𝐵) ↔ 𝒫 𝐴 ∈ (𝑅1‘suc 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 = wceq 1537 ∈ wcel 2114 Vcvv 3496 𝒫 cpw 4541 Ord word 6192 Oncon0 6193 suc csuc 6195 ‘cfv 6357 𝑅1cr1 9193 rankcrnk 9194 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-reg 9058 ax-inf2 9106 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-ral 3145 df-rex 3146 df-reu 3147 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-int 4879 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-om 7583 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-r1 9195 df-rank 9196 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |