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 9268 based on the additional axioms ax-reg 9050 and ax-inf2 9098. (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 2900 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ (𝑅1‘𝐵) ↔ 𝐴 ∈ (𝑅1‘𝐵))) | |
2 | pweq 4542 | . . . . . 6 ⊢ (𝑥 = 𝐴 → 𝒫 𝑥 = 𝒫 𝐴) | |
3 | 2 | eleq1d 2897 | . . . . 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 3498 | . . . . . . 7 ⊢ 𝑥 ∈ V | |
7 | 6 | rankr1a 9259 | . . . . . 6 ⊢ (𝐵 ∈ On → (𝑥 ∈ (𝑅1‘𝐵) ↔ (rank‘𝑥) ∈ 𝐵)) |
8 | eloni 6196 | . . . . . . 7 ⊢ (𝐵 ∈ On → Ord 𝐵) | |
9 | ordsucelsuc 7531 | . . . . . . 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 9266 | . . . . . 6 ⊢ (rank‘𝒫 𝑥) = suc (rank‘𝑥) |
13 | 12 | eleq1i 2903 | . . . . 5 ⊢ ((rank‘𝒫 𝑥) ∈ suc 𝐵 ↔ suc (rank‘𝑥) ∈ suc 𝐵) |
14 | 11, 13 | syl6bbr 291 | . . . 4 ⊢ (𝐵 ∈ On → (𝑥 ∈ (𝑅1‘𝐵) ↔ (rank‘𝒫 𝑥) ∈ suc 𝐵)) |
15 | suceloni 7522 | . . . . 5 ⊢ (𝐵 ∈ On → suc 𝐵 ∈ On) | |
16 | 6 | pwex 5274 | . . . . . 6 ⊢ 𝒫 𝑥 ∈ V |
17 | 16 | rankr1a 9259 | . . . . 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 3568 | . 2 ⊢ (𝐴 ∈ V → (𝐵 ∈ On → (𝐴 ∈ (𝑅1‘𝐵) ↔ 𝒫 𝐴 ∈ (𝑅1‘suc 𝐵)))) |
21 | elex 3513 | . . . 4 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐴 ∈ V) | |
22 | elex 3513 | . . . . 5 ⊢ (𝒫 𝐴 ∈ (𝑅1‘suc 𝐵) → 𝒫 𝐴 ∈ V) | |
23 | pwexb 7482 | . . . . 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 1533 ∈ wcel 2110 Vcvv 3495 𝒫 cpw 4539 Ord word 6185 Oncon0 6186 suc csuc 6188 ‘cfv 6350 𝑅1cr1 9185 rankcrnk 9186 |
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 2156 ax-12 2172 ax-ext 2793 ax-rep 5183 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5322 ax-un 7455 ax-reg 9050 ax-inf2 9098 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 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-reu 3145 df-rab 3147 df-v 3497 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4562 df-pr 4564 df-tp 4566 df-op 4568 df-uni 4833 df-int 4870 df-iun 4914 df-br 5060 df-opab 5122 df-mpt 5140 df-tr 5166 df-id 5455 df-eprel 5460 df-po 5469 df-so 5470 df-fr 5509 df-we 5511 df-xp 5556 df-rel 5557 df-cnv 5558 df-co 5559 df-dm 5560 df-rn 5561 df-res 5562 df-ima 5563 df-pred 6143 df-ord 6189 df-on 6190 df-lim 6191 df-suc 6192 df-iota 6309 df-fun 6352 df-fn 6353 df-f 6354 df-f1 6355 df-fo 6356 df-f1o 6357 df-fv 6358 df-om 7575 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-r1 9187 df-rank 9188 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |