MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  scottelrankd Structured version   Visualization version   GIF version

Theorem scottelrankd 9869
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.
StepHypRef Expression
1 fveq2 6881 . . 3 (𝑦 = 𝐶 → (rank‘𝑦) = (rank‘𝐶))
21sseq2d 3969 . 2 (𝑦 = 𝐶 → ((rank‘𝐵) ⊆ (rank‘𝑦) ↔ (rank‘𝐵) ⊆ (rank‘𝐶)))
3 scottelrankd.1 . . . . 5 (𝜑𝐵 ∈ Scott 𝐴)
4 df-scott 9854 . . . . 5 Scott 𝐴 = {𝑥𝐴 ∣ ∀𝑦𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)}
53, 4eleqtrdi 2873 . . . 4 (𝜑𝐵 ∈ {𝑥𝐴 ∣ ∀𝑦𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)})
6 fveq2 6881 . . . . . . 7 (𝑥 = 𝐵 → (rank‘𝑥) = (rank‘𝐵))
76sseq1d 3968 . . . . . 6 (𝑥 = 𝐵 → ((rank‘𝑥) ⊆ (rank‘𝑦) ↔ (rank‘𝐵) ⊆ (rank‘𝑦)))
87ralbidv 3188 . . . . 5 (𝑥 = 𝐵 → (∀𝑦𝐴 (rank‘𝑥) ⊆ (rank‘𝑦) ↔ ∀𝑦𝐴 (rank‘𝐵) ⊆ (rank‘𝑦)))
98elrab 3650 . . . 4 (𝐵 ∈ {𝑥𝐴 ∣ ∀𝑦𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)} ↔ (𝐵𝐴 ∧ ∀𝑦𝐴 (rank‘𝐵) ⊆ (rank‘𝑦)))
105, 9sylib 221 . . 3 (𝜑 → (𝐵𝐴 ∧ ∀𝑦𝐴 (rank‘𝐵) ⊆ (rank‘𝑦)))
1110simprd 500 . 2 (𝜑 → ∀𝑦𝐴 (rank‘𝐵) ⊆ (rank‘𝑦))
12 scottelrankd.2 . . . 4 (𝜑𝐶 ∈ Scott 𝐴)
1312, 4eleqtrdi 2873 . . 3 (𝜑𝐶 ∈ {𝑥𝐴 ∣ ∀𝑦𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)})
14 elrabi 3646 . . 3 (𝐶 ∈ {𝑥𝐴 ∣ ∀𝑦𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)} → 𝐶𝐴)
1513, 14syl 18 . 2 (𝜑𝐶𝐴)
162, 11, 15rspcdva 3582 1 (𝜑 → (rank‘𝐵) ⊆ (rank‘𝐶))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1570  wcel 2143  wral 3079  {crab 3416  wss 3905  cfv 6536  rankcrnk 9731  Scott cscott 9853
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-iota 6492  df-fv 6544  df-scott 9854
This theorem is referenced by:  scottrankd  9870  elscottrankeq  35515
  Copyright terms: Public domain W3C validator