Theorem scottexf 38763

Description: A version of scottex 9858 with nonfree variables instead of distinct variables. (Contributed by Giovanni Mascellani, 19-Aug-2018.)

Hypotheses

Ref	Expression
scottexf.1	⊢ Ⅎ𝑦𝐴
scottexf.2	⊢ Ⅎ𝑥𝐴

Assertion

Ref	Expression
scottexf	⊢ {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)} ∈ V

Distinct variable group:   𝑥,𝑦

Allowed substitution hints:   𝐴(𝑥,𝑦)

Proof of Theorem scottexf

Dummy variables 𝑧 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		scottexf.1	. . . . 5 ⊢ Ⅎ𝑦𝐴
2		nfcv 2923	. . . . 5 ⊢ Ⅎ𝑧𝐴
3		nfv 1942	. . . . 5 ⊢ Ⅎ𝑧(rank‘𝑥) ⊆ (rank‘𝑦)
4		nfv 1942	. . . . 5 ⊢ Ⅎ𝑦(rank‘𝑥) ⊆ (rank‘𝑧)
5		fveq2 6881	. . . . . 6 ⊢ (𝑦 = 𝑧 → (rank‘𝑦) = (rank‘𝑧))
6	5	sseq2d 3968	. . . . 5 ⊢ (𝑦 = 𝑧 → ((rank‘𝑥) ⊆ (rank‘𝑦) ↔ (rank‘𝑥) ⊆ (rank‘𝑧)))
7	1, 2, 3, 4, 6	cbvralfw 3303	. . . 4 ⊢ (∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦) ↔ ∀𝑧 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑧))
8	7	rabbii 3419	. . 3 ⊢ {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)} = {𝑥 ∈ 𝐴 ∣ ∀𝑧 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑧)}
9		nfcv 2923	. . . 4 ⊢ Ⅎ𝑤𝐴
10		scottexf.2	. . . 4 ⊢ Ⅎ𝑥𝐴
11		nfv 1942	. . . . 5 ⊢ Ⅎ𝑥(rank‘𝑤) ⊆ (rank‘𝑧)
12	10, 11	nfralw 3310	. . . 4 ⊢ Ⅎ𝑥∀𝑧 ∈ 𝐴 (rank‘𝑤) ⊆ (rank‘𝑧)
13		nfv 1942	. . . 4 ⊢ Ⅎ𝑤∀𝑧 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑧)
14		fveq2 6881	. . . . . 6 ⊢ (𝑤 = 𝑥 → (rank‘𝑤) = (rank‘𝑥))
15	14	sseq1d 3967	. . . . 5 ⊢ (𝑤 = 𝑥 → ((rank‘𝑤) ⊆ (rank‘𝑧) ↔ (rank‘𝑥) ⊆ (rank‘𝑧)))
16	15	ralbidv 3186	. . . 4 ⊢ (𝑤 = 𝑥 → (∀𝑧 ∈ 𝐴 (rank‘𝑤) ⊆ (rank‘𝑧) ↔ ∀𝑧 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑧)))
17	9, 10, 12, 13, 16	cbvrabw 3449	. . 3 ⊢ {𝑤 ∈ 𝐴 ∣ ∀𝑧 ∈ 𝐴 (rank‘𝑤) ⊆ (rank‘𝑧)} = {𝑥 ∈ 𝐴 ∣ ∀𝑧 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑧)}
18	8, 17	eqtr4i 2787	. 2 ⊢ {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)} = {𝑤 ∈ 𝐴 ∣ ∀𝑧 ∈ 𝐴 (rank‘𝑤) ⊆ (rank‘𝑧)}
19		scottex 9858	. 2 ⊢ {𝑤 ∈ 𝐴 ∣ ∀𝑧 ∈ 𝐴 (rank‘𝑤) ⊆ (rank‘𝑧)} ∈ V
20	18, 19	eqeltri 2857	1 ⊢ {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)} ∈ V

Syntax hints:   = wceq 1568   ∈ wcel 2141  Ⅎwnfc 2908  ∀wral 3077  {crab 3414  Vcvv 3453   ⊆ wss 3904  ‘cfv 6536  rankcrnk 9734

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

This theorem is referenced by: (None)