Theorem rankbnd2 9909

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

Step	Hyp	Ref	Expression
1		rankuni 9903	. . . . 5 ⊢ (rank‘∪ 𝐴) = ∪ (rank‘𝐴)
2		rankr1b.1	. . . . . 6 ⊢ 𝐴 ∈ V
3	2	rankuni2 9895	. . . . 5 ⊢ (rank‘∪ 𝐴) = ∪ 𝑥 ∈ 𝐴 (rank‘𝑥)
4	1, 3	eqtr3i 2767	. . . 4 ⊢ ∪ (rank‘𝐴) = ∪ 𝑥 ∈ 𝐴 (rank‘𝑥)
5	4	sseq1i 4012	. . 3 ⊢ (∪ (rank‘𝐴) ⊆ 𝐵 ↔ ∪ 𝑥 ∈ 𝐴 (rank‘𝑥) ⊆ 𝐵)
6		iunss 5045	. . 3 ⊢ (∪ 𝑥 ∈ 𝐴 (rank‘𝑥) ⊆ 𝐵 ↔ ∀𝑥 ∈ 𝐴 (rank‘𝑥) ⊆ 𝐵)
7	5, 6	bitr2i 276	. 2 ⊢ (∀𝑥 ∈ 𝐴 (rank‘𝑥) ⊆ 𝐵 ↔ ∪ (rank‘𝐴) ⊆ 𝐵)
8		rankon 9835	. . . 4 ⊢ (rank‘𝐴) ∈ On
9	8	onssi 7858	. . 3 ⊢ (rank‘𝐴) ⊆ On
10		eloni 6394	. . 3 ⊢ (𝐵 ∈ On → Ord 𝐵)
11		ordunisssuc 6490	. . 3 ⊢ (((rank‘𝐴) ⊆ On ∧ Ord 𝐵) → (∪ (rank‘𝐴) ⊆ 𝐵 ↔ (rank‘𝐴) ⊆ suc 𝐵))
12	9, 10, 11	sylancr 587	. 2 ⊢ (𝐵 ∈ On → (∪ (rank‘𝐴) ⊆ 𝐵 ↔ (rank‘𝐴) ⊆ suc 𝐵))
13	7, 12	bitrid 283	1 ⊢ (𝐵 ∈ On → (∀𝑥 ∈ 𝐴 (rank‘𝑥) ⊆ 𝐵 ↔ (rank‘𝐴) ⊆ suc 𝐵))

Syntax hints:   → wi 4   ↔ wb 206   ∈ wcel 2108  ∀wral 3061  Vcvv 3480   ⊆ wss 3951  ∪ cuni 4907  ∪ ciun 4991  Ord word 6383  Oncon0 6384  suc csuc 6386  ‘cfv 6561  rankcrnk 9803

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-rep 5279  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755  ax-reg 9632  ax-inf2 9681

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-pss 3971  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-int 4947  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5226  df-tr 5260  df-id 5578  df-eprel 5584  df-po 5592  df-so 5593  df-fr 5637  df-we 5639  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-pred 6321  df-ord 6387  df-on 6388  df-lim 6389  df-suc 6390  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7434  df-om 7888  df-2nd 8015  df-frecs 8306  df-wrecs 8337  df-recs 8411  df-rdg 8450  df-r1 9804  df-rank 9805

This theorem is referenced by: (None)