Metamath Proof Explorer


Theorem dfscott3

Description: Alternate definition of a Scott's trick set. (Contributed by BTernaryTau, 10-Jul-2026)

Ref Expression
Assertion dfscott3 ⊢ Scott A = A ∩ R1 ⁡ suc ⁡ ⋂ rank A

Proof

Step Hyp Ref Expression
1 dfscott2 ⊢ Scott A = x ∈ A | rank ⁡ x = ⋂ rank A
2 rankfn ⊢ rank Fn V
3 ssv ⊢ A ⊆ V
4 fnfvima ⊢ rank Fn V ∧ A ⊆ V ∧ x ∈ A → rank ⁡ x ∈ rank A
5 2 3 4 mp3an12 ⊢ x ∈ A → rank ⁡ x ∈ rank A
6 intss1 ⊢ rank ⁡ x ∈ rank A → ⋂ rank A ⊆ rank ⁡ x
7 5 6 syl ⊢ x ∈ A → ⋂ rank A ⊆ rank ⁡ x
8 ne0i ⊢ x ∈ A → A ≠ ∅
9 rankfo ⊢ rank : V ⟶ onto On
10 fof ⊢ rank : V ⟶ onto On → rank : V ⟶ On
11 9 10 ax-mp ⊢ rank : V ⟶ On
12 11 fdmi ⊢ dom ⁡ rank = V
13 12 ineq1i ⊢ dom ⁡ rank ∩ A = V ∩ A
14 inv2 ⊢ V ∩ A = A
15 13 14 eqtri ⊢ dom ⁡ rank ∩ A = A
16 15 neeq1i ⊢ dom ⁡ rank ∩ A ≠ ∅ ↔ A ≠ ∅
17 16 biimpri ⊢ A ≠ ∅ → dom ⁡ rank ∩ A ≠ ∅
18 17 imadisjlnd ⊢ A ≠ ∅ → rank A ≠ ∅
19 fimass ⊢ rank : V ⟶ On → rank A ⊆ On
20 11 19 ax-mp ⊢ rank A ⊆ On
21 oninton ⊢ rank A ⊆ On ∧ rank A ≠ ∅ → ⋂ rank A ∈ On
22 20 21 mpan ⊢ rank A ≠ ∅ → ⋂ rank A ∈ On
23 vex ⊢ x ∈ V
24 23 ssrankr1 ⊢ ⋂ rank A ∈ On → ⋂ rank A ⊆ rank ⁡ x ↔ ¬ x ∈ R1 ⁡ ⋂ rank A
25 8 18 22 24 4syl ⊢ x ∈ A → ⋂ rank A ⊆ rank ⁡ x ↔ ¬ x ∈ R1 ⁡ ⋂ rank A
26 7 25 mpbid ⊢ x ∈ A → ¬ x ∈ R1 ⁡ ⋂ rank A
27 26 biantrurd ⊢ x ∈ A → x ∈ R1 ⁡ suc ⁡ ⋂ rank A ↔ ¬ x ∈ R1 ⁡ ⋂ rank A ∧ x ∈ R1 ⁡ suc ⁡ ⋂ rank A
28 23 rankr1 ⊢ ⋂ rank A = rank ⁡ x ↔ ¬ x ∈ R1 ⁡ ⋂ rank A ∧ x ∈ R1 ⁡ suc ⁡ ⋂ rank A
29 27 28 bitr4di ⊢ x ∈ A → x ∈ R1 ⁡ suc ⁡ ⋂ rank A ↔ ⋂ rank A = rank ⁡ x
30 eqcom ⊢ rank ⁡ x = ⋂ rank A ↔ ⋂ rank A = rank ⁡ x
31 29 30 bitr4di ⊢ x ∈ A → x ∈ R1 ⁡ suc ⁡ ⋂ rank A ↔ rank ⁡ x = ⋂ rank A
32 31 adantl ⊢ ⊤ ∧ x ∈ A → x ∈ R1 ⁡ suc ⁡ ⋂ rank A ↔ rank ⁡ x = ⋂ rank A
33 32 rabbi2dva ⊢ ⊤ → A ∩ R1 ⁡ suc ⁡ ⋂ rank A = x ∈ A | rank ⁡ x = ⋂ rank A
34 33 mptru ⊢ A ∩ R1 ⁡ suc ⁡ ⋂ rank A = x ∈ A | rank ⁡ x = ⋂ rank A
35 1 34 eqtr4i ⊢ Scott A = A ∩ R1 ⁡ suc ⁡ ⋂ rank A