Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > rankbnd2 | Structured version Visualization version GIF version |
Description: The rank of a set is bounded by the successor of a bound for its members. (Contributed by NM, 15-Sep-2006.) |
Ref | Expression |
---|---|
rankr1b.1 | ⊢ 𝐴 ∈ V |
Ref | Expression |
---|---|
rankbnd2 | ⊢ (𝐵 ∈ On → (∀𝑥 ∈ 𝐴 (rank‘𝑥) ⊆ 𝐵 ↔ (rank‘𝐴) ⊆ suc 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rankuni 9294 | . . . . 5 ⊢ (rank‘∪ 𝐴) = ∪ (rank‘𝐴) | |
2 | rankr1b.1 | . . . . . 6 ⊢ 𝐴 ∈ V | |
3 | 2 | rankuni2 9286 | . . . . 5 ⊢ (rank‘∪ 𝐴) = ∪ 𝑥 ∈ 𝐴 (rank‘𝑥) |
4 | 1, 3 | eqtr3i 2848 | . . . 4 ⊢ ∪ (rank‘𝐴) = ∪ 𝑥 ∈ 𝐴 (rank‘𝑥) |
5 | 4 | sseq1i 3997 | . . 3 ⊢ (∪ (rank‘𝐴) ⊆ 𝐵 ↔ ∪ 𝑥 ∈ 𝐴 (rank‘𝑥) ⊆ 𝐵) |
6 | iunss 4971 | . . 3 ⊢ (∪ 𝑥 ∈ 𝐴 (rank‘𝑥) ⊆ 𝐵 ↔ ∀𝑥 ∈ 𝐴 (rank‘𝑥) ⊆ 𝐵) | |
7 | 5, 6 | bitr2i 278 | . 2 ⊢ (∀𝑥 ∈ 𝐴 (rank‘𝑥) ⊆ 𝐵 ↔ ∪ (rank‘𝐴) ⊆ 𝐵) |
8 | rankon 9226 | . . . 4 ⊢ (rank‘𝐴) ∈ On | |
9 | 8 | onssi 7554 | . . 3 ⊢ (rank‘𝐴) ⊆ On |
10 | eloni 6203 | . . 3 ⊢ (𝐵 ∈ On → Ord 𝐵) | |
11 | ordunisssuc 6295 | . . 3 ⊢ (((rank‘𝐴) ⊆ On ∧ Ord 𝐵) → (∪ (rank‘𝐴) ⊆ 𝐵 ↔ (rank‘𝐴) ⊆ suc 𝐵)) | |
12 | 9, 10, 11 | sylancr 589 | . 2 ⊢ (𝐵 ∈ On → (∪ (rank‘𝐴) ⊆ 𝐵 ↔ (rank‘𝐴) ⊆ suc 𝐵)) |
13 | 7, 12 | syl5bb 285 | 1 ⊢ (𝐵 ∈ On → (∀𝑥 ∈ 𝐴 (rank‘𝑥) ⊆ 𝐵 ↔ (rank‘𝐴) ⊆ suc 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∈ wcel 2114 ∀wral 3140 Vcvv 3496 ⊆ wss 3938 ∪ cuni 4840 ∪ ciun 4921 Ord word 6192 Oncon0 6193 suc csuc 6195 ‘cfv 6357 rankcrnk 9194 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-reg 9058 ax-inf2 9106 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-ral 3145 df-rex 3146 df-reu 3147 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-int 4879 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-om 7583 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-r1 9195 df-rank 9196 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |