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

Theorem scottsn 35871
Description: Applying Scott's trick to a singleton leaves it unchanged. (Contributed by BTernaryTau, 3-Jul-2026.)
Assertion
Ref Expression
scottsn Scott {𝐴} = {𝐴}

Proof of Theorem scottsn
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-scott 9963 . 2 Scott {𝐴} = {𝑥 ∈ {𝐴} ∣ ∀𝑦 ∈ {𝐴} (rank‘𝑥) ⊆ (rank‘𝑦)}
2 velsn 4597 . . . . . 6 (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴)
3 velsn 4597 . . . . . 6 (𝑦 ∈ {𝐴} ↔ 𝑦 = 𝐴)
4 eqtr3 2786 . . . . . 6 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐴) → 𝑥 = 𝑦)
52, 3, 4syl2anb 610 . . . . 5 ((𝑥 ∈ {𝐴} ∧ 𝑦 ∈ {𝐴}) → 𝑥 = 𝑦)
6 fveq2 6913 . . . . . 6 (𝑥 = 𝑦 → (rank‘𝑥) = (rank‘𝑦))
76eqimssd 3966 . . . . 5 (𝑥 = 𝑦 → (rank‘𝑥) ⊆ (rank‘𝑦))
85, 7syl 18 . . . 4 ((𝑥 ∈ {𝐴} ∧ 𝑦 ∈ {𝐴}) → (rank‘𝑥) ⊆ (rank‘𝑦))
98ralrimiva 3159 . . 3 (𝑥 ∈ {𝐴} → ∀𝑦 ∈ {𝐴} (rank‘𝑥) ⊆ (rank‘𝑦))
109rabeqc 3425 . 2 {𝑥 ∈ {𝐴} ∣ ∀𝑦 ∈ {𝐴} (rank‘𝑥) ⊆ (rank‘𝑦)} = {𝐴}
111, 10eqtri 2787 1 Scott {𝐴} = {𝐴}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570   ∈ wcel 2148  ∀wral 3081  {crab 3413   ⊆ wss 3897  {csn 4585  ‘cfv 6563  rankcrnk 9801  Scott cscott 9962
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 2150  ax-9 2158  ax-ext 2736
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 2743  df-cleq 2756  df-clel 2840  df-ral 3082  df-rab 3414  df-v 3453  df-ss 3898  df-dif 4047  df-un 4151  df-nul 4279  df-if 4483  df-sn 4586  df-pr 4588  df-op 4838  df-uni 4870  df-br 5106  df-iota 6517  df-fv 6571  df-scott 9963
This theorem is used by:  kard0  35959
  Copyright terms: Public domain W3C validator