| 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 9768 | . . 3 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) ↔ ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥)) | |
| 2 | nfcv 2932 | . . . . . 6 ⊢ Ⅎ𝑥𝑅1 | |
| 3 | nfrab1 3443 | . . . . . . . 8 ⊢ Ⅎ𝑥{𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} | |
| 4 | 3 | nfint 4927 | . . . . . . 7 ⊢ Ⅎ𝑥∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} |
| 5 | 4 | nfsuc 6439 | . . . . . 6 ⊢ Ⅎ𝑥 suc ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} |
| 6 | 2, 5 | nffv 6895 | . . . . 5 ⊢ Ⅎ𝑥(𝑅1‘suc ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)}) |
| 7 | 6 | nfel2 2950 | . . . 4 ⊢ Ⅎ𝑥 𝐴 ∈ (𝑅1‘suc ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)}) |
| 8 | suceq 6433 | . . . . . 6 ⊢ (𝑥 = ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} → suc 𝑥 = suc ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)}) | |
| 9 | 8 | fveq2d 6889 | . . . . 5 ⊢ (𝑥 = ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} → (𝑅1‘suc 𝑥) = (𝑅1‘suc ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})) |
| 10 | 9 | eleq2d 2856 | . . . 4 ⊢ (𝑥 = ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} → (𝐴 ∈ (𝑅1‘suc 𝑥) ↔ 𝐴 ∈ (𝑅1‘suc ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)}))) |
| 11 | 7, 10 | onminsb 7796 | . . 3 ⊢ (∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥) → 𝐴 ∈ (𝑅1‘suc ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})) |
| 12 | 1, 11 | sylbi 220 | . 2 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → 𝐴 ∈ (𝑅1‘suc ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})) |
| 13 | rankvalb 9772 | . . . 4 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → (rank‘𝐴) = ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)}) | |
| 14 | suceq 6433 | . . . 4 ⊢ ((rank‘𝐴) = ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} → suc (rank‘𝐴) = suc ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)}) | |
| 15 | 13, 14 | syl 18 | . . 3 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → suc (rank‘𝐴) = suc ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)}) |
| 16 | 15 | fveq2d 6889 | . 2 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → (𝑅1‘suc (rank‘𝐴)) = (𝑅1‘suc ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})) |
| 17 | 12, 16 | eleqtrrd 2873 | 1 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → 𝐴 ∈ (𝑅1‘suc (rank‘𝐴))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1568 ∈ wcel 2150 ∃wrex 3096 {crab 3423 ∪ cuni 4877 ∩ cint 4917 “ cima 5668 Oncon0 6364 suc csuc 6366 ‘cfv 6540 𝑅1cr1 9737 rankcrnk 9738 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2199 ax-12 2220 ax-ext 2742 ax-sep 5262 ax-nul 5274 ax-pow 5340 ax-pr 5408 ax-un 7736 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2099 df-mo 2574 df-eu 2604 df-clab 2749 df-cleq 2762 df-clel 2845 df-nfc 2919 df-ne 2966 df-ral 3087 df-rex 3097 df-reu 3377 df-rab 3424 df-v 3464 df-sbc 3753 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-int 4918 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-tr 5224 df-id 5560 df-eprel 5565 df-po 5573 df-so 5574 df-fr 5618 df-we 5620 df-xp 5671 df-rel 5672 df-cnv 5673 df-co 5674 df-dm 5675 df-rn 5676 df-res 5677 df-ima 5678 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-ov 7417 df-om 7866 df-2nd 7990 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-rdg 8400 df-r1 9739 df-rank 9740 |
| This theorem is referenced by: rankdmr1 9776 rankr1ag 9777 sswf 9783 uniwf 9794 rankonidlem 9803 rankid 9808 dfac12lem2 10131 rankval4b 35461 r1filimi 35465 aomclem4 43736 |
| Copyright terms: Public domain | W3C validator |