| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rankidb | Structured version Visualization version GIF version | ||
| Description: Identity law for the rank function. (Contributed by NM, 3-Oct-2003.) (Revised by Mario Carneiro, 22-Mar-2013.) |
| Ref | Expression |
|---|---|
| rankidb | ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → 𝐴 ∈ (𝑅1‘suc (rank‘𝐴))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rankwflemb 9712 | . . 3 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) ↔ ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥)) | |
| 2 | nfcv 2903 | . . . . . 6 ⊢ Ⅎ𝑥𝑅1 | |
| 3 | nfrab1 3413 | . . . . . . . 8 ⊢ Ⅎ𝑥{𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} | |
| 4 | 3 | nfint 4890 | . . . . . . 7 ⊢ Ⅎ𝑥∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} |
| 5 | 4 | nfsuc 6388 | . . . . . 6 ⊢ Ⅎ𝑥 suc ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} |
| 6 | 2, 5 | nffv 6841 | . . . . 5 ⊢ Ⅎ𝑥(𝑅1‘suc ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)}) |
| 7 | 6 | nfel2 2921 | . . . 4 ⊢ Ⅎ𝑥 𝐴 ∈ (𝑅1‘suc ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)}) |
| 8 | suceq 6382 | . . . . . 6 ⊢ (𝑥 = ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} → suc 𝑥 = suc ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)}) | |
| 9 | 8 | fveq2d 6835 | . . . . 5 ⊢ (𝑥 = ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} → (𝑅1‘suc 𝑥) = (𝑅1‘suc ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})) |
| 10 | 9 | eleq2d 2827 | . . . 4 ⊢ (𝑥 = ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} → (𝐴 ∈ (𝑅1‘suc 𝑥) ↔ 𝐴 ∈ (𝑅1‘suc ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)}))) |
| 11 | 7, 10 | onminsb 7741 | . . 3 ⊢ (∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥) → 𝐴 ∈ (𝑅1‘suc ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})) |
| 12 | 1, 11 | sylbi 219 | . 2 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → 𝐴 ∈ (𝑅1‘suc ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})) |
| 13 | rankvalb 9716 | . . . 4 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → (rank‘𝐴) = ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)}) | |
| 14 | suceq 6382 | . . . 4 ⊢ ((rank‘𝐴) = ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} → suc (rank‘𝐴) = suc ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)}) | |
| 15 | 13, 14 | syl 17 | . . 3 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → suc (rank‘𝐴) = suc ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)}) |
| 16 | 15 | fveq2d 6835 | . 2 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → (𝑅1‘suc (rank‘𝐴)) = (𝑅1‘suc ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})) |
| 17 | 12, 16 | eleqtrrd 2844 | 1 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → 𝐴 ∈ (𝑅1‘suc (rank‘𝐴))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1548 ∈ wcel 2121 ∃wrex 3065 {crab 3393 ∪ cuni 4841 ∩ cint 4880 “ cima 5624 Oncon0 6314 suc csuc 6316 ‘cfv 6489 𝑅1cr1 9681 rankcrnk 9682 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-sep 5221 ax-nul 5231 ax-pow 5297 ax-pr 5365 ax-un 7682 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3or 1094 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-ral 3056 df-rex 3066 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-pss 3905 df-nul 4265 df-if 4458 df-pw 4534 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4842 df-int 4881 df-iun 4926 df-br 5076 df-opab 5138 df-mpt 5157 df-tr 5183 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6256 df-ord 6317 df-on 6318 df-lim 6319 df-suc 6320 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-ov 7363 df-om 7811 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-r1 9683 df-rank 9684 |
| This theorem is referenced by: rankdmr1 9720 rankr1ag 9721 sswf 9727 uniwf 9738 rankonidlem 9747 rankid 9752 dfac12lem2 10062 rankval4b 35296 r1filimi 35299 aomclem4 43517 |
| Copyright terms: Public domain | W3C validator |