Theorem scottex 9872

Description: Scott's trick produces a set. (Contributed by NM, 13-Oct-2003.) Use the Scott operation. (Revised by BTernaryTau, 18-Jul-2026.)

Assertion

Ref	Expression
scottex	⊢ Scott 𝐴 ∈ V

Proof of Theorem scottex

Dummy variables 𝑣 𝑥 𝑦 𝑤 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-scott 9868	. 2 ⊢ Scott 𝐴 = {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)}
2		0ex 5264	. . . . 5 ⊢ ∅ ∈ V
3		eleq1 2848	. . . . 5 ⊢ (𝐴 = ∅ → (𝐴 ∈ V ↔ ∅ ∈ V))
4	2, 3	mpbiri 261	. . . 4 ⊢ (𝐴 = ∅ → 𝐴 ∈ V)
5		rabexg 5302	. . . 4 ⊢ (𝐴 ∈ V → {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)} ∈ V)
6	4, 5	syl 18	. . 3 ⊢ (𝐴 = ∅ → {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)} ∈ V)
7		neq0 4299	. . . 4 ⊢ (¬ 𝐴 = ∅ ↔ ∃𝑣 𝑣 ∈ 𝐴)
8		fveq2 6878	. . . . . . . . . 10 ⊢ (𝑦 = 𝑣 → (rank‘𝑦) = (rank‘𝑣))
9	8	sseq2d 3963	. . . . . . . . 9 ⊢ (𝑦 = 𝑣 → ((rank‘𝑥) ⊆ (rank‘𝑦) ↔ (rank‘𝑥) ⊆ (rank‘𝑣)))
10	9	rspcv 3572	. . . . . . . 8 ⊢ (𝑣 ∈ 𝐴 → (∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦) → (rank‘𝑥) ⊆ (rank‘𝑣)))
11	10	adantr 486	. . . . . . 7 ⊢ ((𝑣 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → (∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦) → (rank‘𝑥) ⊆ (rank‘𝑣)))
12	11	ss2rabdv 4023	. . . . . 6 ⊢ (𝑣 ∈ 𝐴 → {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)} ⊆ {𝑥 ∈ 𝐴 ∣ (rank‘𝑥) ⊆ (rank‘𝑣)})
13		rankon 9777	. . . . . . . . 9 ⊢ (rank‘𝑣) ∈ On
14		fveq2 6878	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑤 → (rank‘𝑥) = (rank‘𝑤))
15	14	sseq1d 3962	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑤 → ((rank‘𝑥) ⊆ (rank‘𝑣) ↔ (rank‘𝑤) ⊆ (rank‘𝑣)))
16	15	elrab 3645	. . . . . . . . . . 11 ⊢ (𝑤 ∈ {𝑥 ∈ 𝐴 ∣ (rank‘𝑥) ⊆ (rank‘𝑣)} ↔ (𝑤 ∈ 𝐴 ∧ (rank‘𝑤) ⊆ (rank‘𝑣)))
17	16	simprbi 503	. . . . . . . . . 10 ⊢ (𝑤 ∈ {𝑥 ∈ 𝐴 ∣ (rank‘𝑥) ⊆ (rank‘𝑣)} → (rank‘𝑤) ⊆ (rank‘𝑣))
18	17	rgen 3078	. . . . . . . . 9 ⊢ ∀𝑤 ∈ {𝑥 ∈ 𝐴 ∣ (rank‘𝑥) ⊆ (rank‘𝑣)} (rank‘𝑤) ⊆ (rank‘𝑣)
19		sseq2 3957	. . . . . . . . . . 11 ⊢ (𝑧 = (rank‘𝑣) → ((rank‘𝑤) ⊆ 𝑧 ↔ (rank‘𝑤) ⊆ (rank‘𝑣)))
20	19	ralbidv 3185	. . . . . . . . . 10 ⊢ (𝑧 = (rank‘𝑣) → (∀𝑤 ∈ {𝑥 ∈ 𝐴 ∣ (rank‘𝑥) ⊆ (rank‘𝑣)} (rank‘𝑤) ⊆ 𝑧 ↔ ∀𝑤 ∈ {𝑥 ∈ 𝐴 ∣ (rank‘𝑥) ⊆ (rank‘𝑣)} (rank‘𝑤) ⊆ (rank‘𝑣)))
21	20	rspcev 3576	. . . . . . . . 9 ⊢ (((rank‘𝑣) ∈ On ∧ ∀𝑤 ∈ {𝑥 ∈ 𝐴 ∣ (rank‘𝑥) ⊆ (rank‘𝑣)} (rank‘𝑤) ⊆ (rank‘𝑣)) → ∃𝑧 ∈ On ∀𝑤 ∈ {𝑥 ∈ 𝐴 ∣ (rank‘𝑥) ⊆ (rank‘𝑣)} (rank‘𝑤) ⊆ 𝑧)
22	13, 18, 21	mp2an 705	. . . . . . . 8 ⊢ ∃𝑧 ∈ On ∀𝑤 ∈ {𝑥 ∈ 𝐴 ∣ (rank‘𝑥) ⊆ (rank‘𝑣)} (rank‘𝑤) ⊆ 𝑧
23		bndrank 9823	. . . . . . . 8 ⊢ (∃𝑧 ∈ On ∀𝑤 ∈ {𝑥 ∈ 𝐴 ∣ (rank‘𝑥) ⊆ (rank‘𝑣)} (rank‘𝑤) ⊆ 𝑧 → {𝑥 ∈ 𝐴 ∣ (rank‘𝑥) ⊆ (rank‘𝑣)} ∈ V)
24	22, 23	ax-mp 5	. . . . . . 7 ⊢ {𝑥 ∈ 𝐴 ∣ (rank‘𝑥) ⊆ (rank‘𝑣)} ∈ V
25	24	ssex 5285	. . . . . 6 ⊢ ({𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)} ⊆ {𝑥 ∈ 𝐴 ∣ (rank‘𝑥) ⊆ (rank‘𝑣)} → {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)} ∈ V)
26	12, 25	syl 18	. . . . 5 ⊢ (𝑣 ∈ 𝐴 → {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)} ∈ V)
27	26	exlimiv 1963	. . . 4 ⊢ (∃𝑣 𝑣 ∈ 𝐴 → {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)} ∈ V)
28	7, 27	sylbi 220	. . 3 ⊢ (¬ 𝐴 = ∅ → {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)} ∈ V)
29	6, 28	pm2.61i 184	. 2 ⊢ {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)} ∈ V
30	1, 29	eqeltri 2856	1 ⊢ Scott 𝐴 ∈ V

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∀wral 3076  ∃wrex 3086  {crab 3412  Vcvv 3450   ⊆ wss 3899  ∅c0 4279  Oncon0 6357  ‘cfv 6533  rankcrnk 9745  Scott cscott 9867

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 7736  ax-reg 9564  ax-inf2 9620

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 7416  df-om 7863  df-2nd 7987  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-rdg 8399  df-r1 9746  df-rank 9747  df-scott 9868

This theorem is used by:  scottrankd  9888  cplem2  9891  kardex  9896  hta  9901  rankscottu  35636  scottssr1  35637  kardfn  35677  kardval  35678  scottexf  38916  gruscottcld  45073  collexd  45081