Theorem rankscottu 35639

Description: An upper bound on the rank of a Scott's trick set. (Contributed by BTernaryTau, 4-Jul-2026.)

Assertion

Ref	Expression
rankscottu	⊢ (𝐴 ∈ 𝐵 → (rank‘Scott 𝐵) ⊆ suc (rank‘𝐴))

Proof of Theorem rankscottu

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		id 23	. . . . . . 7 ⊢ (𝑥 ∈ Scott 𝐵 → 𝑥 ∈ Scott 𝐵)
2	1	scottrankd 9891	. . . . . 6 ⊢ (𝑥 ∈ Scott 𝐵 → (rank‘Scott 𝐵) = suc (rank‘𝑥))
3	2	adantr 486	. . . . 5 ⊢ ((𝑥 ∈ Scott 𝐵 ∧ 𝐴 ∈ 𝐵) → (rank‘Scott 𝐵) = suc (rank‘𝑥))
4		elscottrankss 35633	. . . . . 6 ⊢ ((𝑥 ∈ Scott 𝐵 ∧ 𝐴 ∈ 𝐵) → (rank‘𝑥) ⊆ (rank‘𝐴))
5		rankon 9780	. . . . . . . 8 ⊢ (rank‘𝑥) ∈ On
6	5	onordi 6471	. . . . . . 7 ⊢ Ord (rank‘𝑥)
7		rankon 9780	. . . . . . . 8 ⊢ (rank‘𝐴) ∈ On
8	7	onordi 6471	. . . . . . 7 ⊢ Ord (rank‘𝐴)
9		ordsucsssuc 7820	. . . . . . 7 ⊢ ((Ord (rank‘𝑥) ∧ Ord (rank‘𝐴)) → ((rank‘𝑥) ⊆ (rank‘𝐴) ↔ suc (rank‘𝑥) ⊆ suc (rank‘𝐴)))
10	6, 8, 9	mp2an 705	. . . . . 6 ⊢ ((rank‘𝑥) ⊆ (rank‘𝐴) ↔ suc (rank‘𝑥) ⊆ suc (rank‘𝐴))
11	4, 10	sylib 221	. . . . 5 ⊢ ((𝑥 ∈ Scott 𝐵 ∧ 𝐴 ∈ 𝐵) → suc (rank‘𝑥) ⊆ suc (rank‘𝐴))
12	3, 11	eqsstrd 3965	. . . 4 ⊢ ((𝑥 ∈ Scott 𝐵 ∧ 𝐴 ∈ 𝐵) → (rank‘Scott 𝐵) ⊆ suc (rank‘𝐴))
13	12	ex 418	. . 3 ⊢ (𝑥 ∈ Scott 𝐵 → (𝐴 ∈ 𝐵 → (rank‘Scott 𝐵) ⊆ suc (rank‘𝐴)))
14	13	exlimiv 1963	. 2 ⊢ (∃𝑥 𝑥 ∈ Scott 𝐵 → (𝐴 ∈ 𝐵 → (rank‘Scott 𝐵) ⊆ suc (rank‘𝐴)))
15		neq0 4299	. . . . 5 ⊢ (¬ Scott 𝐵 = ∅ ↔ ∃𝑥 𝑥 ∈ Scott 𝐵)
16	15	con1bii 359	. . . 4 ⊢ (¬ ∃𝑥 𝑥 ∈ Scott 𝐵 ↔ Scott 𝐵 = ∅)
17		scottex 9875	. . . . . 6 ⊢ Scott 𝐵 ∈ V
18	17	rankeq0 9846	. . . . 5 ⊢ (Scott 𝐵 = ∅ ↔ (rank‘Scott 𝐵) = ∅)
19		0ss 4350	. . . . . 6 ⊢ ∅ ⊆ suc (rank‘𝐴)
20		sseq1 3956	. . . . . 6 ⊢ ((rank‘Scott 𝐵) = ∅ → ((rank‘Scott 𝐵) ⊆ suc (rank‘𝐴) ↔ ∅ ⊆ suc (rank‘𝐴)))
21	19, 20	mpbiri 261	. . . . 5 ⊢ ((rank‘Scott 𝐵) = ∅ → (rank‘Scott 𝐵) ⊆ suc (rank‘𝐴))
22	18, 21	sylbi 220	. . . 4 ⊢ (Scott 𝐵 = ∅ → (rank‘Scott 𝐵) ⊆ suc (rank‘𝐴))
23	16, 22	sylbi 220	. . 3 ⊢ (¬ ∃𝑥 𝑥 ∈ Scott 𝐵 → (rank‘Scott 𝐵) ⊆ suc (rank‘𝐴))
24	23	a1d 26	. 2 ⊢ (¬ ∃𝑥 𝑥 ∈ Scott 𝐵 → (𝐴 ∈ 𝐵 → (rank‘Scott 𝐵) ⊆ suc (rank‘𝐴)))
25	14, 24	pm2.61i 184	1 ⊢ (𝐴 ∈ 𝐵 → (rank‘Scott 𝐵) ⊆ suc (rank‘𝐴))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145   ⊆ wss 3899  ∅c0 4279  Ord word 6356  suc csuc 6359  ‘cfv 6533  rankcrnk 9748  Scott cscott 9870

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737  ax-reg 9567  ax-inf2 9623

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7417  df-om 7864  df-2nd 7988  df-frecs 8281  df-wrecs 8312  df-recs 8361  df-rdg 8400  df-r1 9749  df-rank 9750  df-scott 9871

This theorem is used by:  scottssr1  35640  rankkardu  35700