| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rankc1 | 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 |
|---|---|
| rankc1 | ⊢ (∀𝑥 ∈ 𝐴 (rank‘𝑥) ∈ (rank‘∪ 𝐴) ↔ (rank‘𝐴) = (rank‘∪ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rankr1b.1 | . . . 4 ⊢ 𝐴 ∈ V | |
| 2 | 1 | rankuniss 9836 | . . 3 ⊢ (rank‘∪ 𝐴) ⊆ (rank‘𝐴) |
| 3 | 2 | biantru 538 | . 2 ⊢ ((rank‘𝐴) ⊆ (rank‘∪ 𝐴) ↔ ((rank‘𝐴) ⊆ (rank‘∪ 𝐴) ∧ (rank‘∪ 𝐴) ⊆ (rank‘𝐴))) |
| 4 | iunss 5008 | . . 3 ⊢ (∪ 𝑥 ∈ 𝐴 suc (rank‘𝑥) ⊆ (rank‘∪ 𝐴) ↔ ∀𝑥 ∈ 𝐴 suc (rank‘𝑥) ⊆ (rank‘∪ 𝐴)) | |
| 5 | 1 | rankval4 9837 | . . . 4 ⊢ (rank‘𝐴) = ∪ 𝑥 ∈ 𝐴 suc (rank‘𝑥) |
| 6 | 5 | sseq1i 3964 | . . 3 ⊢ ((rank‘𝐴) ⊆ (rank‘∪ 𝐴) ↔ ∪ 𝑥 ∈ 𝐴 suc (rank‘𝑥) ⊆ (rank‘∪ 𝐴)) |
| 7 | rankon 9765 | . . . . 5 ⊢ (rank‘𝑥) ∈ On | |
| 8 | rankon 9765 | . . . . 5 ⊢ (rank‘∪ 𝐴) ∈ On | |
| 9 | 7, 8 | onsucssi 7835 | . . . 4 ⊢ ((rank‘𝑥) ∈ (rank‘∪ 𝐴) ↔ suc (rank‘𝑥) ⊆ (rank‘∪ 𝐴)) |
| 10 | 9 | ralbii 3110 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 (rank‘𝑥) ∈ (rank‘∪ 𝐴) ↔ ∀𝑥 ∈ 𝐴 suc (rank‘𝑥) ⊆ (rank‘∪ 𝐴)) |
| 11 | 4, 6, 10 | 3bitr4ri 307 | . 2 ⊢ (∀𝑥 ∈ 𝐴 (rank‘𝑥) ∈ (rank‘∪ 𝐴) ↔ (rank‘𝐴) ⊆ (rank‘∪ 𝐴)) |
| 12 | eqss 3951 | . 2 ⊢ ((rank‘𝐴) = (rank‘∪ 𝐴) ↔ ((rank‘𝐴) ⊆ (rank‘∪ 𝐴) ∧ (rank‘∪ 𝐴) ⊆ (rank‘𝐴))) | |
| 13 | 3, 11, 12 | 3bitr4i 306 | 1 ⊢ (∀𝑥 ∈ 𝐴 (rank‘𝑥) ∈ (rank‘∪ 𝐴) ↔ (rank‘𝐴) = (rank‘∪ 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 400 = wceq 1569 ∈ wcel 2142 ∀wral 3078 Vcvv 3454 ⊆ wss 3904 ∪ cuni 4871 ∪ ciun 4955 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 |