Theorem scottelrankd 43094

Description: Property of a Scott's trick set. (Contributed by Rohan Ridenour, 11-Aug-2023.)

Hypotheses

Ref	Expression
scottelrankd.1	⊢ (𝜑 → 𝐵 ∈ Scott 𝐴)
scottelrankd.2	⊢ (𝜑 → 𝐶 ∈ Scott 𝐴)

Assertion

Ref	Expression
scottelrankd	⊢ (𝜑 → (rank‘𝐵) ⊆ (rank‘𝐶))

Proof of Theorem scottelrankd

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

Step	Hyp	Ref	Expression
1		fveq2 6891	. . 3 ⊢ (𝑦 = 𝐶 → (rank‘𝑦) = (rank‘𝐶))
2	1	sseq2d 4014	. 2 ⊢ (𝑦 = 𝐶 → ((rank‘𝐵) ⊆ (rank‘𝑦) ↔ (rank‘𝐵) ⊆ (rank‘𝐶)))
3		scottelrankd.1	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ Scott 𝐴)
4		df-scott 43083	. . . . 5 ⊢ Scott 𝐴 = {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)}
5	3, 4	eleqtrdi 2843	. . . 4 ⊢ (𝜑 → 𝐵 ∈ {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)})
6		fveq2 6891	. . . . . . 7 ⊢ (𝑥 = 𝐵 → (rank‘𝑥) = (rank‘𝐵))
7	6	sseq1d 4013	. . . . . 6 ⊢ (𝑥 = 𝐵 → ((rank‘𝑥) ⊆ (rank‘𝑦) ↔ (rank‘𝐵) ⊆ (rank‘𝑦)))
8	7	ralbidv 3177	. . . . 5 ⊢ (𝑥 = 𝐵 → (∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦) ↔ ∀𝑦 ∈ 𝐴 (rank‘𝐵) ⊆ (rank‘𝑦)))
9	8	elrab 3683	. . . 4 ⊢ (𝐵 ∈ {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)} ↔ (𝐵 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐴 (rank‘𝐵) ⊆ (rank‘𝑦)))
10	5, 9	sylib 217	. . 3 ⊢ (𝜑 → (𝐵 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐴 (rank‘𝐵) ⊆ (rank‘𝑦)))
11	10	simprd 496	. 2 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 (rank‘𝐵) ⊆ (rank‘𝑦))
12		scottelrankd.2	. . . 4 ⊢ (𝜑 → 𝐶 ∈ Scott 𝐴)
13	12, 4	eleqtrdi 2843	. . 3 ⊢ (𝜑 → 𝐶 ∈ {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)})
14		elrabi 3677	. . 3 ⊢ (𝐶 ∈ {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)} → 𝐶 ∈ 𝐴)
15	13, 14	syl 17	. 2 ⊢ (𝜑 → 𝐶 ∈ 𝐴)
16	2, 11, 15	rspcdva 3613	1 ⊢ (𝜑 → (rank‘𝐵) ⊆ (rank‘𝐶))

Syntax hints:   → wi 4   ∧ wa 396   = wceq 1541   ∈ wcel 2106  ∀wral 3061  {crab 3432   ⊆ wss 3948  ‘cfv 6543  rankcrnk 9760  Scott cscott 43082

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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2703

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-sb 2068  df-clab 2710  df-cleq 2724  df-clel 2810  df-ral 3062  df-rab 3433  df-v 3476  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-br 5149  df-iota 6495  df-fv 6551  df-scott 43083

This theorem is referenced by:  scottrankd  43095