Definition df-scott 43077

Description: Define the Scott operation. This operation constructs a subset of the input class which is nonempty whenever its input is using Scott's trick. (Contributed by Rohan Ridenour, 9-Aug-2023.)

Assertion

Ref	Expression
df-scott	⊢ Scott 𝐴 = {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)}

Distinct variable group:   𝑥,𝑦,𝐴

Detailed syntax breakdown of Definition df-scott

Step	Hyp	Ref	Expression
1		cA	. . 3 class 𝐴
2	1	cscott 43076	. 2 class Scott 𝐴
3		vx	. . . . . . 7 setvar 𝑥
4	3	cv 1540	. . . . . 6 class 𝑥
5		crnk 9760	. . . . . 6 class rank
6	4, 5	cfv 6543	. . . . 5 class (rank‘𝑥)
7		vy	. . . . . . 7 setvar 𝑦
8	7	cv 1540	. . . . . 6 class 𝑦
9	8, 5	cfv 6543	. . . . 5 class (rank‘𝑦)
10	6, 9	wss 3948	. . . 4 wff (rank‘𝑥) ⊆ (rank‘𝑦)
11	10, 7, 1	wral 3061	. . 3 wff ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)
12	11, 3, 1	crab 3432	. 2 class {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)}
13	2, 12	wceq 1541	1 wff Scott 𝐴 = {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)}

This definition is referenced by:  scotteqd  43078  nfscott  43080  scottabf  43081  scottss  43084  scottex2  43086  scotteld  43087  scottelrankd  43088