Theorem dfscott3 35827

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.

Step	Hyp	Ref	Expression
1		dfscott2 35826	. 2 ⊢ Scott 𝐴 = {𝑥 ∈ 𝐴 ∣ (rank‘𝑥) = ∩ (rank “ 𝐴)}
2		rankfn 35818	. . . . . . . . . . 11 ⊢ rank Fn V
3		ssv 3937	. . . . . . . . . . 11 ⊢ 𝐴 ⊆ V
4		fnfvima 7262	. . . . . . . . . . 11 ⊢ ((rank Fn V ∧ 𝐴 ⊆ V ∧ 𝑥 ∈ 𝐴) → (rank‘𝑥) ∈ (rank “ 𝐴))
5	2, 3, 4	mp3an12 1481	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝐴 → (rank‘𝑥) ∈ (rank “ 𝐴))
6		intss1 4926	. . . . . . . . . 10 ⊢ ((rank‘𝑥) ∈ (rank “ 𝐴) → ∩ (rank “ 𝐴) ⊆ (rank‘𝑥))
7	5, 6	syl 18	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐴 → ∩ (rank “ 𝐴) ⊆ (rank‘𝑥))
8		ne0i 4290	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝐴 → 𝐴 ≠ ∅)
9		rankfo 35817	. . . . . . . . . . . . . . . . 17 ⊢ rank:V⟶ontoOn
10		fof 6818	. . . . . . . . . . . . . . . . 17 ⊢ (rank:V⟶ontoOn → rank:V⟶On)
11	9, 10	ax-mp 5	. . . . . . . . . . . . . . . 16 ⊢ rank:V⟶On
12	11	fdmi 6743	. . . . . . . . . . . . . . 15 ⊢ dom rank = V
13	12	ineq1i 4116	. . . . . . . . . . . . . 14 ⊢ (dom rank ∩ 𝐴) = (V ∩ 𝐴)
14		inv2 35781	. . . . . . . . . . . . . 14 ⊢ (V ∩ 𝐴) = 𝐴
15	13, 14	eqtri 2786	. . . . . . . . . . . . 13 ⊢ (dom rank ∩ 𝐴) = 𝐴
16	15	neeq1i 3023	. . . . . . . . . . . 12 ⊢ ((dom rank ∩ 𝐴) ≠ ∅ ↔ 𝐴 ≠ ∅)
17	16	biimpri 231	. . . . . . . . . . 11 ⊢ (𝐴 ≠ ∅ → (dom rank ∩ 𝐴) ≠ ∅)
18	17	imadisjlnd 6090	. . . . . . . . . 10 ⊢ (𝐴 ≠ ∅ → (rank “ 𝐴) ≠ ∅)
19		fimass 6752	. . . . . . . . . . . 12 ⊢ (rank:V⟶On → (rank “ 𝐴) ⊆ On)
20	11, 19	ax-mp 5	. . . . . . . . . . 11 ⊢ (rank “ 𝐴) ⊆ On
21		oninton 7833	. . . . . . . . . . 11 ⊢ (((rank “ 𝐴) ⊆ On ∧ (rank “ 𝐴) ≠ ∅) → ∩ (rank “ 𝐴) ∈ On)
22	20, 21	mpan 703	. . . . . . . . . 10 ⊢ ((rank “ 𝐴) ≠ ∅ → ∩ (rank “ 𝐴) ∈ On)
23		vex 3458	. . . . . . . . . . 11 ⊢ 𝑥 ∈ V
24	23	ssrankr1 9874	. . . . . . . . . 10 ⊢ (∩ (rank “ 𝐴) ∈ On → (∩ (rank “ 𝐴) ⊆ (rank‘𝑥) ↔ ¬ 𝑥 ∈ (𝑅1‘∩ (rank “ 𝐴))))
25	8, 18, 22, 24	4syl 20	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐴 → (∩ (rank “ 𝐴) ⊆ (rank‘𝑥) ↔ ¬ 𝑥 ∈ (𝑅1‘∩ (rank “ 𝐴))))
26	7, 25	mpbid 235	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ (𝑅1‘∩ (rank “ 𝐴)))
27	26	biantrurd 542	. . . . . . 7 ⊢ (𝑥 ∈ 𝐴 → (𝑥 ∈ (𝑅1‘suc ∩ (rank “ 𝐴)) ↔ (¬ 𝑥 ∈ (𝑅1‘∩ (rank “ 𝐴)) ∧ 𝑥 ∈ (𝑅1‘suc ∩ (rank “ 𝐴)))))
28	23	rankr1 9873	. . . . . . 7 ⊢ (∩ (rank “ 𝐴) = (rank‘𝑥) ↔ (¬ 𝑥 ∈ (𝑅1‘∩ (rank “ 𝐴)) ∧ 𝑥 ∈ (𝑅1‘suc ∩ (rank “ 𝐴))))
29	27, 28	bitr4di 292	. . . . . 6 ⊢ (𝑥 ∈ 𝐴 → (𝑥 ∈ (𝑅1‘suc ∩ (rank “ 𝐴)) ↔ ∩ (rank “ 𝐴) = (rank‘𝑥)))
30		eqcom 2770	. . . . . 6 ⊢ ((rank‘𝑥) = ∩ (rank “ 𝐴) ↔ ∩ (rank “ 𝐴) = (rank‘𝑥))
31	29, 30	bitr4di 292	. . . . 5 ⊢ (𝑥 ∈ 𝐴 → (𝑥 ∈ (𝑅1‘suc ∩ (rank “ 𝐴)) ↔ (rank‘𝑥) = ∩ (rank “ 𝐴)))
32	31	adantl 487	. . . 4 ⊢ ((⊤ ∧ 𝑥 ∈ 𝐴) → (𝑥 ∈ (𝑅1‘suc ∩ (rank “ 𝐴)) ↔ (rank‘𝑥) = ∩ (rank “ 𝐴)))
33	32	rabbi2dva 4125	. . 3 ⊢ (⊤ → (𝐴 ∩ (𝑅1‘suc ∩ (rank “ 𝐴))) = {𝑥 ∈ 𝐴 ∣ (rank‘𝑥) = ∩ (rank “ 𝐴)})
34	33	mptru 1577	. 2 ⊢ (𝐴 ∩ (𝑅1‘suc ∩ (rank “ 𝐴))) = {𝑥 ∈ 𝐴 ∣ (rank‘𝑥) = ∩ (rank “ 𝐴)}
35	1, 34	eqtr4i 2789	1 ⊢ Scott 𝐴 = (𝐴 ∩ (𝑅1‘suc ∩ (rank “ 𝐴)))

This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   ∧ wa 401   = wceq 1570  ⊤wtru 1571   ∈ wcel 2147   ≠ wne 2959  {crab 3416  Vcvv 3454   ⊆ wss 3900   ∩ cin 4092  ∅c0 4281  ∩ cint 4910  dom cdm 5655   “ cima 5658  Oncon0 6380  suc csuc 6382   Fn wfn 6553  ⟶wf 6554  ⟶ontowfo 6556  ‘cfv 6558  𝑅₁cr1 9793  rankcrnk 9794  Scott cscott 9955

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-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775  ax-reg 9613  ax-inf2 9669

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6322  df-ord 6383  df-on 6384  df-lim 6385  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-ov 7446  df-om 7902  df-2nd 8026  df-frecs 8327  df-wrecs 8358  df-recs 8407  df-rdg 8446  df-r1 9795  df-rank 9796  df-scott 9956

This theorem is used by:  trscott  35842