Mathbox for Rohan Ridenour |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > scottelrankd | Structured version Visualization version GIF version |
Description: Property of a Scott's trick set. (Contributed by Rohan Ridenour, 11-Aug-2023.) |
Ref | Expression |
---|---|
scottelrankd.1 | ⊢ (𝜑 → 𝐵 ∈ Scott 𝐴) |
scottelrankd.2 | ⊢ (𝜑 → 𝐶 ∈ Scott 𝐴) |
Ref | Expression |
---|---|
scottelrankd | ⊢ (𝜑 → (rank‘𝐵) ⊆ (rank‘𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fveq2 6674 | . . 3 ⊢ (𝑦 = 𝐶 → (rank‘𝑦) = (rank‘𝐶)) | |
2 | 1 | sseq2d 3909 | . 2 ⊢ (𝑦 = 𝐶 → ((rank‘𝐵) ⊆ (rank‘𝑦) ↔ (rank‘𝐵) ⊆ (rank‘𝐶))) |
3 | scottelrankd.1 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ Scott 𝐴) | |
4 | df-scott 41396 | . . . . 5 ⊢ Scott 𝐴 = {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)} | |
5 | 3, 4 | eleqtrdi 2843 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)}) |
6 | fveq2 6674 | . . . . . . 7 ⊢ (𝑥 = 𝐵 → (rank‘𝑥) = (rank‘𝐵)) | |
7 | 6 | sseq1d 3908 | . . . . . 6 ⊢ (𝑥 = 𝐵 → ((rank‘𝑥) ⊆ (rank‘𝑦) ↔ (rank‘𝐵) ⊆ (rank‘𝑦))) |
8 | 7 | ralbidv 3109 | . . . . 5 ⊢ (𝑥 = 𝐵 → (∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦) ↔ ∀𝑦 ∈ 𝐴 (rank‘𝐵) ⊆ (rank‘𝑦))) |
9 | 8 | elrab 3588 | . . . 4 ⊢ (𝐵 ∈ {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)} ↔ (𝐵 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐴 (rank‘𝐵) ⊆ (rank‘𝑦))) |
10 | 5, 9 | sylib 221 | . . 3 ⊢ (𝜑 → (𝐵 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐴 (rank‘𝐵) ⊆ (rank‘𝑦))) |
11 | 10 | simprd 499 | . 2 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 (rank‘𝐵) ⊆ (rank‘𝑦)) |
12 | scottelrankd.2 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ Scott 𝐴) | |
13 | 12, 4 | eleqtrdi 2843 | . . 3 ⊢ (𝜑 → 𝐶 ∈ {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)}) |
14 | elrabi 3582 | . . 3 ⊢ (𝐶 ∈ {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)} → 𝐶 ∈ 𝐴) | |
15 | 13, 14 | syl 17 | . 2 ⊢ (𝜑 → 𝐶 ∈ 𝐴) |
16 | 2, 11, 15 | rspcdva 3528 | 1 ⊢ (𝜑 → (rank‘𝐵) ⊆ (rank‘𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1542 ∈ wcel 2114 ∀wral 3053 {crab 3057 ⊆ wss 3843 ‘cfv 6339 rankcrnk 9265 Scott cscott 41395 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2020 ax-8 2116 ax-9 2124 ax-ext 2710 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 847 df-3an 1090 df-tru 1545 df-ex 1787 df-sb 2075 df-clab 2717 df-cleq 2730 df-clel 2811 df-ral 3058 df-rab 3062 df-v 3400 df-un 3848 df-in 3850 df-ss 3860 df-sn 4517 df-pr 4519 df-op 4523 df-uni 4797 df-br 5031 df-iota 6297 df-fv 6347 df-scott 41396 |
This theorem is referenced by: scottrankd 41408 |
Copyright terms: Public domain | W3C validator |