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

Theorem dfscott3 35478
Description: Alternate definition of a Scott's trick set. (Contributed by BTernaryTau, 10-Jul-2026.)
Assertion
Ref Expression
dfscott3 Scott 𝐴 = (𝐴 ∩ (𝑅1‘suc (rank “ 𝐴)))

Proof of Theorem dfscott3
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 dfscott2 35477 . 2 Scott 𝐴 = {𝑥𝐴 ∣ (rank‘𝑥) = (rank “ 𝐴)}
2 rankfn 35472 . . . . . . . . . . 11 rank Fn V
3 ssv 3960 . . . . . . . . . . 11 𝐴 ⊆ V
4 fnfvima 7231 . . . . . . . . . . 11 ((rank Fn V ∧ 𝐴 ⊆ V ∧ 𝑥𝐴) → (rank‘𝑥) ∈ (rank “ 𝐴))
52, 3, 4mp3an12 1478 . . . . . . . . . 10 (𝑥𝐴 → (rank‘𝑥) ∈ (rank “ 𝐴))
6 intss1 4927 . . . . . . . . . 10 ((rank‘𝑥) ∈ (rank “ 𝐴) → (rank “ 𝐴) ⊆ (rank‘𝑥))
75, 6syl 18 . . . . . . . . 9 (𝑥𝐴 (rank “ 𝐴) ⊆ (rank‘𝑥))
8 ne0i 4293 . . . . . . . . . 10 (𝑥𝐴𝐴 ≠ ∅)
9 rankfo 35471 . . . . . . . . . . . . . . . . 17 rank:V–onto→On
10 fof 6792 . . . . . . . . . . . . . . . . 17 (rank:V–onto→On → rank:V⟶On)
119, 10ax-mp 5 . . . . . . . . . . . . . . . 16 rank:V⟶On
1211fdmi 6717 . . . . . . . . . . . . . . 15 dom rank = V
1312ineq1i 4168 . . . . . . . . . . . . . 14 (dom rank ∩ 𝐴) = (V ∩ 𝐴)
14 inv2 35433 . . . . . . . . . . . . . 14 (V ∩ 𝐴) = 𝐴
1513, 14eqtri 2784 . . . . . . . . . . . . 13 (dom rank ∩ 𝐴) = 𝐴
1615neeq1i 3020 . . . . . . . . . . . 12 ((dom rank ∩ 𝐴) ≠ ∅ ↔ 𝐴 ≠ ∅)
1716biimpri 231 . . . . . . . . . . 11 (𝐴 ≠ ∅ → (dom rank ∩ 𝐴) ≠ ∅)
1817imadisjlnd 6083 . . . . . . . . . 10 (𝐴 ≠ ∅ → (rank “ 𝐴) ≠ ∅)
19 fimass 6726 . . . . . . . . . . . 12 (rank:V⟶On → (rank “ 𝐴) ⊆ On)
2011, 19ax-mp 5 . . . . . . . . . . 11 (rank “ 𝐴) ⊆ On
21 oninton 7793 . . . . . . . . . . 11 (((rank “ 𝐴) ⊆ On ∧ (rank “ 𝐴) ≠ ∅) → (rank “ 𝐴) ∈ On)
2220, 21mpan 702 . . . . . . . . . 10 ((rank “ 𝐴) ≠ ∅ → (rank “ 𝐴) ∈ On)
23 vex 3457 . . . . . . . . . . 11 𝑥 ∈ V
2423ssrankr1 9806 . . . . . . . . . 10 ( (rank “ 𝐴) ∈ On → ( (rank “ 𝐴) ⊆ (rank‘𝑥) ↔ ¬ 𝑥 ∈ (𝑅1 (rank “ 𝐴))))
258, 18, 22, 244syl 20 . . . . . . . . 9 (𝑥𝐴 → ( (rank “ 𝐴) ⊆ (rank‘𝑥) ↔ ¬ 𝑥 ∈ (𝑅1 (rank “ 𝐴))))
267, 25mpbid 235 . . . . . . . 8 (𝑥𝐴 → ¬ 𝑥 ∈ (𝑅1 (rank “ 𝐴)))
2726biantrurd 541 . . . . . . 7 (𝑥𝐴 → (𝑥 ∈ (𝑅1‘suc (rank “ 𝐴)) ↔ (¬ 𝑥 ∈ (𝑅1 (rank “ 𝐴)) ∧ 𝑥 ∈ (𝑅1‘suc (rank “ 𝐴)))))
2823rankr1 9805 . . . . . . 7 ( (rank “ 𝐴) = (rank‘𝑥) ↔ (¬ 𝑥 ∈ (𝑅1 (rank “ 𝐴)) ∧ 𝑥 ∈ (𝑅1‘suc (rank “ 𝐴))))
2927, 28bitr4di 292 . . . . . 6 (𝑥𝐴 → (𝑥 ∈ (𝑅1‘suc (rank “ 𝐴)) ↔ (rank “ 𝐴) = (rank‘𝑥)))
30 eqcom 2768 . . . . . 6 ((rank‘𝑥) = (rank “ 𝐴) ↔ (rank “ 𝐴) = (rank‘𝑥))
3129, 30bitr4di 292 . . . . 5 (𝑥𝐴 → (𝑥 ∈ (𝑅1‘suc (rank “ 𝐴)) ↔ (rank‘𝑥) = (rank “ 𝐴)))
3231adantl 486 . . . 4 ((⊤ ∧ 𝑥𝐴) → (𝑥 ∈ (𝑅1‘suc (rank “ 𝐴)) ↔ (rank‘𝑥) = (rank “ 𝐴)))
3332rabbi2dva 4177 . . 3 (⊤ → (𝐴 ∩ (𝑅1‘suc (rank “ 𝐴))) = {𝑥𝐴 ∣ (rank‘𝑥) = (rank “ 𝐴)})
3433mptru 1575 . 2 (𝐴 ∩ (𝑅1‘suc (rank “ 𝐴))) = {𝑥𝐴 ∣ (rank‘𝑥) = (rank “ 𝐴)}
351, 34eqtr4i 2787 1 Scott 𝐴 = (𝐴 ∩ (𝑅1‘suc (rank “ 𝐴)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 209  wa 400   = wceq 1568  wtru 1569  wcel 2141  wne 2956  {crab 3414  Vcvv 3453  cin 3903  wss 3904  c0 4285   cint 4911  dom cdm 5661  cima 5664  Oncon0 6360  suc csuc 6362   Fn wfn 6531  wf 6532  ontowfo 6534  cfv 6536  𝑅1cr1 9733  rankcrnk 9734  Scott cscott 9856
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pow 5336  ax-pr 5404  ax-un 7732  ax-reg 9553  ax-inf2 9609
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1571  df-fal 1581  df-ex 1808  df-nf 1812  df-sb 2095  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-int 4912  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-om 7862  df-2nd 7986  df-frecs 8277  df-wrecs 8308  df-recs 8357  df-rdg 8396  df-r1 9735  df-rank 9736  df-scott 9857
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator