MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  rankbnd2 Structured version   Visualization version   GIF version

Theorem rankbnd2 9783
Description: The rank of a set is bounded by the successor of a bound for its members. (Contributed by NM, 15-Sep-2006.)
Hypothesis
Ref Expression
rankr1b.1 𝐴 ∈ V
Assertion
Ref Expression
rankbnd2 (𝐵 ∈ On → (∀𝑥𝐴 (rank‘𝑥) ⊆ 𝐵 ↔ (rank‘𝐴) ⊆ suc 𝐵))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem rankbnd2
StepHypRef Expression
1 rankuni 9777 . . . . 5 (rank‘ 𝐴) = (rank‘𝐴)
2 rankr1b.1 . . . . . 6 𝐴 ∈ V
32rankuni2 9769 . . . . 5 (rank‘ 𝐴) = 𝑥𝐴 (rank‘𝑥)
41, 3eqtr3i 2760 . . . 4 (rank‘𝐴) = 𝑥𝐴 (rank‘𝑥)
54sseq1i 3961 . . 3 ( (rank‘𝐴) ⊆ 𝐵 𝑥𝐴 (rank‘𝑥) ⊆ 𝐵)
6 iunss 4999 . . 3 ( 𝑥𝐴 (rank‘𝑥) ⊆ 𝐵 ↔ ∀𝑥𝐴 (rank‘𝑥) ⊆ 𝐵)
75, 6bitr2i 276 . 2 (∀𝑥𝐴 (rank‘𝑥) ⊆ 𝐵 (rank‘𝐴) ⊆ 𝐵)
8 rankon 9709 . . . 4 (rank‘𝐴) ∈ On
98onssi 7780 . . 3 (rank‘𝐴) ⊆ On
10 eloni 6326 . . 3 (𝐵 ∈ On → Ord 𝐵)
11 ordunisssuc 6424 . . 3 (((rank‘𝐴) ⊆ On ∧ Ord 𝐵) → ( (rank‘𝐴) ⊆ 𝐵 ↔ (rank‘𝐴) ⊆ suc 𝐵))
129, 10, 11sylancr 588 . 2 (𝐵 ∈ On → ( (rank‘𝐴) ⊆ 𝐵 ↔ (rank‘𝐴) ⊆ suc 𝐵))
137, 12bitrid 283 1 (𝐵 ∈ On → (∀𝑥𝐴 (rank‘𝑥) ⊆ 𝐵 ↔ (rank‘𝐴) ⊆ suc 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wcel 2114  wral 3050  Vcvv 3439  wss 3900   cuni 4862   ciun 4945  Ord word 6315  Oncon0 6316  suc csuc 6318  cfv 6491  rankcrnk 9677
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2183  ax-ext 2707  ax-rep 5223  ax-sep 5240  ax-nul 5250  ax-pow 5309  ax-pr 5376  ax-un 7680  ax-reg 9499  ax-inf2 9552
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2538  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2810  df-nfc 2884  df-ne 2932  df-ral 3051  df-rex 3060  df-reu 3350  df-rab 3399  df-v 3441  df-sbc 3740  df-csb 3849  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-pss 3920  df-nul 4285  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-int 4902  df-iun 4947  df-br 5098  df-opab 5160  df-mpt 5179  df-tr 5205  df-id 5518  df-eprel 5523  df-po 5531  df-so 5532  df-fr 5576  df-we 5578  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-pred 6258  df-ord 6319  df-on 6320  df-lim 6321  df-suc 6322  df-iota 6447  df-fun 6493  df-fn 6494  df-f 6495  df-f1 6496  df-fo 6497  df-f1o 6498  df-fv 6499  df-ov 7361  df-om 7809  df-2nd 7934  df-frecs 8223  df-wrecs 8254  df-recs 8303  df-rdg 8341  df-r1 9678  df-rank 9679
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator