| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rankc2 | Structured version Visualization version GIF version | ||
| Description: A relationship that can be used for computation of rank. (Contributed by NM, 16-Sep-2006.) |
| Ref | Expression |
|---|---|
| rankr1b.1 | ⊢ 𝐴 ∈ V |
| Ref | Expression |
|---|---|
| rankc2 | ⊢ (∃𝑥 ∈ 𝐴 (rank‘𝑥) = (rank‘∪ 𝐴) → (rank‘𝐴) = suc (rank‘∪ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pwuni 4910 | . . . . 5 ⊢ 𝐴 ⊆ 𝒫 ∪ 𝐴 | |
| 2 | rankr1b.1 | . . . . . . . 8 ⊢ 𝐴 ∈ V | |
| 3 | 2 | uniex 7741 | . . . . . . 7 ⊢ ∪ 𝐴 ∈ V |
| 4 | 3 | pwex 5350 | . . . . . 6 ⊢ 𝒫 ∪ 𝐴 ∈ V |
| 5 | 4 | rankss 9819 | . . . . 5 ⊢ (𝐴 ⊆ 𝒫 ∪ 𝐴 → (rank‘𝐴) ⊆ (rank‘𝒫 ∪ 𝐴)) |
| 6 | 1, 5 | ax-mp 5 | . . . 4 ⊢ (rank‘𝐴) ⊆ (rank‘𝒫 ∪ 𝐴) |
| 7 | 3 | rankpw 9813 | . . . 4 ⊢ (rank‘𝒫 ∪ 𝐴) = suc (rank‘∪ 𝐴) |
| 8 | 6, 7 | sseqtri 3984 | . . 3 ⊢ (rank‘𝐴) ⊆ suc (rank‘∪ 𝐴) |
| 9 | 8 | a1i 11 | . 2 ⊢ (∃𝑥 ∈ 𝐴 (rank‘𝑥) = (rank‘∪ 𝐴) → (rank‘𝐴) ⊆ suc (rank‘∪ 𝐴)) |
| 10 | 2 | rankel 9809 | . . . . 5 ⊢ (𝑥 ∈ 𝐴 → (rank‘𝑥) ∈ (rank‘𝐴)) |
| 11 | eleq1 2850 | . . . . 5 ⊢ ((rank‘𝑥) = (rank‘∪ 𝐴) → ((rank‘𝑥) ∈ (rank‘𝐴) ↔ (rank‘∪ 𝐴) ∈ (rank‘𝐴))) | |
| 12 | 10, 11 | syl5ibcom 248 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → ((rank‘𝑥) = (rank‘∪ 𝐴) → (rank‘∪ 𝐴) ∈ (rank‘𝐴))) |
| 13 | 12 | rexlimiv 3158 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 (rank‘𝑥) = (rank‘∪ 𝐴) → (rank‘∪ 𝐴) ∈ (rank‘𝐴)) |
| 14 | rankon 9765 | . . . 4 ⊢ (rank‘∪ 𝐴) ∈ On | |
| 15 | rankon 9765 | . . . 4 ⊢ (rank‘𝐴) ∈ On | |
| 16 | 14, 15 | onsucssi 7835 | . . 3 ⊢ ((rank‘∪ 𝐴) ∈ (rank‘𝐴) ↔ suc (rank‘∪ 𝐴) ⊆ (rank‘𝐴)) |
| 17 | 13, 16 | sylib 221 | . 2 ⊢ (∃𝑥 ∈ 𝐴 (rank‘𝑥) = (rank‘∪ 𝐴) → suc (rank‘∪ 𝐴) ⊆ (rank‘𝐴)) |
| 18 | 9, 17 | eqssd 3953 | 1 ⊢ (∃𝑥 ∈ 𝐴 (rank‘𝑥) = (rank‘∪ 𝐴) → (rank‘𝐴) = suc (rank‘∪ 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2142 ∃wrex 3088 Vcvv 3454 ⊆ wss 3904 𝒫 cpw 4561 ∪ cuni 4871 suc csuc 6362 ‘cfv 6536 rankcrnk 9733 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-reg 9552 ax-inf2 9608 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-int 4912 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 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 7415 df-om 7861 df-2nd 7985 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-r1 9734 df-rank 9735 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |