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 6879 . . 3 (𝑦 = 𝐶 → (rank‘𝑦) = (rank‘𝐶))
21sseq2d 3977 . 2 (𝑦 = 𝐶 → ((rank‘𝐵) ⊆ (rank‘𝑦) ↔ (rank‘𝐵) ⊆ (rank‘𝐶)))
3 scottelrankd.1 . . . . 5 (𝜑𝐵 ∈ Scott 𝐴)
4 df-scott 9854 . . . . 5 Scott 𝐴 = {𝑥𝐴 ∣ ∀𝑦𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)}
53, 4eleqtrdi 2879 . . . 4 (𝜑𝐵 ∈ {𝑥𝐴 ∣ ∀𝑦𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)})
6 fveq2 6879 . . . . . . 7 (𝑥 = 𝐵 → (rank‘𝑥) = (rank‘𝐵))
76sseq1d 3976 . . . . . 6 (𝑥 = 𝐵 → ((rank‘𝑥) ⊆ (rank‘𝑦) ↔ (rank‘𝐵) ⊆ (rank‘𝑦)))
87ralbidv 3194 . . . . 5 (𝑥 = 𝐵 → (∀𝑦𝐴 (rank‘𝑥) ⊆ (rank‘𝑦) ↔ ∀𝑦𝐴 (rank‘𝐵) ⊆ (rank‘𝑦)))
98elrab 3659 . . . 4 (𝐵 ∈ {𝑥𝐴 ∣ ∀𝑦𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)} ↔ (𝐵𝐴 ∧ ∀𝑦𝐴 (rank‘𝐵) ⊆ (rank‘𝑦)))
105, 9sylib 221 . . 3 (𝜑 → (𝐵𝐴 ∧ ∀𝑦𝐴 (rank‘𝐵) ⊆ (rank‘𝑦)))
1110simprd 500 . 2 (𝜑 → ∀𝑦𝐴 (rank‘𝐵) ⊆ (rank‘𝑦))
12 scottelrankd.2 . . . 4 (𝜑𝐶 ∈ Scott 𝐴)
1312, 4eleqtrdi 2879 . . 3 (𝜑𝐶 ∈ {𝑥𝐴 ∣ ∀𝑦𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)})
14 elrabi 3655 . . 3 (𝐶 ∈ {𝑥𝐴 ∣ ∀𝑦𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)} → 𝐶𝐴)
1513, 14syl 18 . 2 (𝜑𝐶𝐴)
162, 11, 15rspcdva 3591 1 (𝜑 → (rank‘𝐵) ⊆ (rank‘𝐶))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1567  wcel 2149  wral 3085  {crab 3423  wss 3913  cfv 6533  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 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ral 3086  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-ss 3930  df-nul 4295  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-br 5111  df-iota 6489  df-fv 6541  df-scott 9854
This theorem is referenced by:  scottrankd  9870
  Copyright terms: Public domain W3C validator