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

Theorem scottrankd 44244
Description: Rank of a nonempty Scott's trick set. (Contributed by Rohan Ridenour, 11-Aug-2023.)
Hypothesis
Ref Expression
scottrankd.1 (𝜑𝐵 ∈ Scott 𝐴)
Assertion
Ref Expression
scottrankd (𝜑 → (rank‘Scott 𝐴) = suc (rank‘𝐵))

Proof of Theorem scottrankd
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 scottex2 44241 . . . 4 Scott 𝐴 ∈ V
21rankval4 9905 . . 3 (rank‘Scott 𝐴) = 𝑥 ∈ Scott 𝐴 suc (rank‘𝑥)
32a1i 11 . 2 (𝜑 → (rank‘Scott 𝐴) = 𝑥 ∈ Scott 𝐴 suc (rank‘𝑥))
4 scottrankd.1 . . . . . . 7 (𝜑𝐵 ∈ Scott 𝐴)
54adantr 480 . . . . . 6 ((𝜑𝑥 ∈ Scott 𝐴) → 𝐵 ∈ Scott 𝐴)
6 simpr 484 . . . . . 6 ((𝜑𝑥 ∈ Scott 𝐴) → 𝑥 ∈ Scott 𝐴)
75, 6scottelrankd 44243 . . . . 5 ((𝜑𝑥 ∈ Scott 𝐴) → (rank‘𝐵) ⊆ (rank‘𝑥))
86, 5scottelrankd 44243 . . . . 5 ((𝜑𝑥 ∈ Scott 𝐴) → (rank‘𝑥) ⊆ (rank‘𝐵))
97, 8eqssd 4013 . . . 4 ((𝜑𝑥 ∈ Scott 𝐴) → (rank‘𝐵) = (rank‘𝑥))
109suceqd 44200 . . 3 ((𝜑𝑥 ∈ Scott 𝐴) → suc (rank‘𝐵) = suc (rank‘𝑥))
1110iuneq2dv 5021 . 2 (𝜑 𝑥 ∈ Scott 𝐴 suc (rank‘𝐵) = 𝑥 ∈ Scott 𝐴 suc (rank‘𝑥))
124ne0d 4348 . . 3 (𝜑 → Scott 𝐴 ≠ ∅)
13 iunconst 5006 . . 3 (Scott 𝐴 ≠ ∅ → 𝑥 ∈ Scott 𝐴 suc (rank‘𝐵) = suc (rank‘𝐵))
1412, 13syl 17 . 2 (𝜑 𝑥 ∈ Scott 𝐴 suc (rank‘𝐵) = suc (rank‘𝐵))
153, 11, 143eqtr2d 2781 1 (𝜑 → (rank‘Scott 𝐴) = suc (rank‘𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1537  wcel 2106  wne 2938  c0 4339   ciun 4996  suc csuc 6388  cfv 6563  rankcrnk 9801  Scott cscott 44231
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754  ax-reg 9630  ax-inf2 9679
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-int 4952  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-pred 6323  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-ov 7434  df-om 7888  df-2nd 8014  df-frecs 8305  df-wrecs 8336  df-recs 8410  df-rdg 8449  df-r1 9802  df-rank 9803  df-scott 44232
This theorem is referenced by:  gruscottcld  44245
  Copyright terms: Public domain W3C validator