Users' Mathboxes Mathbox for BTernaryTau < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  elscottrankss Structured version   Visualization version   GIF version

Theorem elscottrankss 35872
Description: Relationship between the ranks of an element in a Scott's trick set and an element in the input class. (Contributed by BTernaryTau, 3-Jul-2026.)
Assertion
Ref Expression
elscottrankss ((𝐴 ∈ Scott 𝐵 ∧ 𝐶 ∈ 𝐵) → (rank‘𝐴) ⊆ (rank‘𝐶))

Proof of Theorem elscottrankss
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 elscott 35866 . . 3 (𝐴 ∈ Scott 𝐵 ↔ (𝐴 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐵 (rank‘𝐴) ⊆ (rank‘𝑥)))
21simprbi 503 . 2 (𝐴 ∈ Scott 𝐵 → ∀𝑥 ∈ 𝐵 (rank‘𝐴) ⊆ (rank‘𝑥))
3 fveq2 6916 . . . 4 (𝑥 = 𝐶 → (rank‘𝑥) = (rank‘𝐶))
43sseq2d 3945 . . 3 (𝑥 = 𝐶 → ((rank‘𝐴) ⊆ (rank‘𝑥) ↔ (rank‘𝐴) ⊆ (rank‘𝐶)))
54rspccva 3579 . 2 ((∀𝑥 ∈ 𝐵 (rank‘𝐴) ⊆ (rank‘𝑥) ∧ 𝐶 ∈ 𝐵) → (rank‘𝐴) ⊆ (rank‘𝐶))
62, 5sylan 592 1 ((𝐴 ∈ Scott 𝐵 ∧ 𝐶 ∈ 𝐵) → (rank‘𝐴) ⊆ (rank‘𝐶))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080   ⊆ wss 3900  ‘cfv 6566  rankcrnk 9804  Scott cscott 9965
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-iota 6520  df-fv 6574  df-scott 9966
This theorem is used by:  nelscottrankgt  35874  rankscottu  35880
  Copyright terms: Public domain W3C validator