MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  scott0b Structured version   Visualization version   GIF version

Theorem scott0b 9971
Description: Applying Scott's trick yields the empty set iff it was applied to the empty set. (Contributed by NM, 15-Oct-2003.) Use the Scott operation. (Revised by BTernaryTau, 19-Jul-2026.)
Assertion
Ref Expression
scott0b (𝐴 = ∅ ↔ Scott 𝐴 = ∅)

Proof of Theorem scott0b
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 scotteq 9965 . . 3 (𝐴 = ∅ → Scott 𝐴 = Scott ∅)
2 scott0 9970 . . 3 Scott ∅ = ∅
31, 2eqtrdi 2815 . 2 (𝐴 = ∅ → Scott 𝐴 = ∅)
4 df-scott 9963 . . . 4 Scott 𝐴 = {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)}
54eqeq1i 2769 . . 3 (Scott 𝐴 = ∅ ↔ {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)} = ∅)
6 n0 4300 . . . . . . . . 9 (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴)
7 nfre1 3289 . . . . . . . . . 10 Ⅎ𝑥∃𝑥 ∈ 𝐴 (rank‘𝑥) = (rank‘𝑥)
8 eqid 2764 . . . . . . . . . . 11 (rank‘𝑥) = (rank‘𝑥)
9 rspe 3254 . . . . . . . . . . 11 ((𝑥 ∈ 𝐴 ∧ (rank‘𝑥) = (rank‘𝑥)) → ∃𝑥 ∈ 𝐴 (rank‘𝑥) = (rank‘𝑥))
108, 9mpan2 704 . . . . . . . . . 10 (𝑥 ∈ 𝐴 → ∃𝑥 ∈ 𝐴 (rank‘𝑥) = (rank‘𝑥))
117, 10exlimi 2258 . . . . . . . . 9 (∃𝑥 𝑥 ∈ 𝐴 → ∃𝑥 ∈ 𝐴 (rank‘𝑥) = (rank‘𝑥))
126, 11sylbi 220 . . . . . . . 8 (𝐴 ≠ ∅ → ∃𝑥 ∈ 𝐴 (rank‘𝑥) = (rank‘𝑥))
13 fvex 6926 . . . . . . . . . . . 12 (rank‘𝑥) ∈ V
14 eqeq1 2768 . . . . . . . . . . . . 13 (𝑦 = (rank‘𝑥) → (𝑦 = (rank‘𝑥) ↔ (rank‘𝑥) = (rank‘𝑥)))
1514anbi2d 642 . . . . . . . . . . . 12 (𝑦 = (rank‘𝑥) → ((𝑥 ∈ 𝐴 ∧ 𝑦 = (rank‘𝑥)) ↔ (𝑥 ∈ 𝐴 ∧ (rank‘𝑥) = (rank‘𝑥))))
1613, 15spcev 3561 . . . . . . . . . . 11 ((𝑥 ∈ 𝐴 ∧ (rank‘𝑥) = (rank‘𝑥)) → ∃𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 = (rank‘𝑥)))
1716eximi 1868 . . . . . . . . . 10 (∃𝑥(𝑥 ∈ 𝐴 ∧ (rank‘𝑥) = (rank‘𝑥)) → ∃𝑥∃𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 = (rank‘𝑥)))
18 excom 2203 . . . . . . . . . 10 (∃𝑦∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 = (rank‘𝑥)) ↔ ∃𝑥∃𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 = (rank‘𝑥)))
1917, 18sylibr 237 . . . . . . . . 9 (∃𝑥(𝑥 ∈ 𝐴 ∧ (rank‘𝑥) = (rank‘𝑥)) → ∃𝑦∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 = (rank‘𝑥)))
20 df-rex 3092 . . . . . . . . 9 (∃𝑥 ∈ 𝐴 (rank‘𝑥) = (rank‘𝑥) ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ (rank‘𝑥) = (rank‘𝑥)))
21 df-rex 3092 . . . . . . . . . 10 (∃𝑥 ∈ 𝐴 𝑦 = (rank‘𝑥) ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 = (rank‘𝑥)))
2221exbii 1881 . . . . . . . . 9 (∃𝑦∃𝑥 ∈ 𝐴 𝑦 = (rank‘𝑥) ↔ ∃𝑦∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 = (rank‘𝑥)))
2319, 20, 223imtr4i 295 . . . . . . . 8 (∃𝑥 ∈ 𝐴 (rank‘𝑥) = (rank‘𝑥) → ∃𝑦∃𝑥 ∈ 𝐴 𝑦 = (rank‘𝑥))
2412, 23syl 18 . . . . . . 7 (𝐴 ≠ ∅ → ∃𝑦∃𝑥 ∈ 𝐴 𝑦 = (rank‘𝑥))
25 abn0 4334 . . . . . . 7 ({𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (rank‘𝑥)} ≠ ∅ ↔ ∃𝑦∃𝑥 ∈ 𝐴 𝑦 = (rank‘𝑥))
2624, 25sylibr 237 . . . . . 6 (𝐴 ≠ ∅ → {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (rank‘𝑥)} ≠ ∅)
2713dfiin2 4993 . . . . . . 7 ∩ 𝑥 ∈ 𝐴 (rank‘𝑥) = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (rank‘𝑥)}
28 rankon 9837 . . . . . . . . . . 11 (rank‘𝑥) ∈ On
29 eleq1 2853 . . . . . . . . . . 11 (𝑦 = (rank‘𝑥) → (𝑦 ∈ On ↔ (rank‘𝑥) ∈ On))
3028, 29mpbiri 261 . . . . . . . . . 10 (𝑦 = (rank‘𝑥) → 𝑦 ∈ On)
3130rexlimivw 3164 . . . . . . . . 9 (∃𝑥 ∈ 𝐴 𝑦 = (rank‘𝑥) → 𝑦 ∈ On)
3231abssi 3993 . . . . . . . 8 {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (rank‘𝑥)} ⊆ On
33 onint 7835 . . . . . . . 8 (({𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (rank‘𝑥)} ⊆ On ∧ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (rank‘𝑥)} ≠ ∅) → ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (rank‘𝑥)} ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (rank‘𝑥)})
3432, 33mpan 703 . . . . . . 7 ({𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (rank‘𝑥)} ≠ ∅ → ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (rank‘𝑥)} ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (rank‘𝑥)})
3527, 34eqeltrid 2869 . . . . . 6 ({𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (rank‘𝑥)} ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (rank‘𝑥) ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (rank‘𝑥)})
36 nfii1 4989 . . . . . . . . . 10 Ⅎ𝑥∩ 𝑥 ∈ 𝐴 (rank‘𝑥)
3736nfeq2 2944 . . . . . . . . 9 Ⅎ𝑥 𝑦 = ∩ 𝑥 ∈ 𝐴 (rank‘𝑥)
38 eqeq1 2768 . . . . . . . . 9 (𝑦 = ∩ 𝑥 ∈ 𝐴 (rank‘𝑥) → (𝑦 = (rank‘𝑥) ↔ ∩ 𝑥 ∈ 𝐴 (rank‘𝑥) = (rank‘𝑥)))
3937, 38rexbid 3278 . . . . . . . 8 (𝑦 = ∩ 𝑥 ∈ 𝐴 (rank‘𝑥) → (∃𝑥 ∈ 𝐴 𝑦 = (rank‘𝑥) ↔ ∃𝑥 ∈ 𝐴 ∩ 𝑥 ∈ 𝐴 (rank‘𝑥) = (rank‘𝑥)))
4039elabg 3630 . . . . . . 7 (∩ 𝑥 ∈ 𝐴 (rank‘𝑥) ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (rank‘𝑥)} → (∩ 𝑥 ∈ 𝐴 (rank‘𝑥) ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (rank‘𝑥)} ↔ ∃𝑥 ∈ 𝐴 ∩ 𝑥 ∈ 𝐴 (rank‘𝑥) = (rank‘𝑥)))
4140ibi 270 . . . . . 6 (∩ 𝑥 ∈ 𝐴 (rank‘𝑥) ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (rank‘𝑥)} → ∃𝑥 ∈ 𝐴 ∩ 𝑥 ∈ 𝐴 (rank‘𝑥) = (rank‘𝑥))
42 ssid 3932 . . . . . . . . . . 11 (rank‘𝑦) ⊆ (rank‘𝑦)
43 fveq2 6913 . . . . . . . . . . . . 13 (𝑥 = 𝑦 → (rank‘𝑥) = (rank‘𝑦))
4443sseq1d 3941 . . . . . . . . . . . 12 (𝑥 = 𝑦 → ((rank‘𝑥) ⊆ (rank‘𝑦) ↔ (rank‘𝑦) ⊆ (rank‘𝑦)))
4544rspcev 3577 . . . . . . . . . . 11 ((𝑦 ∈ 𝐴 ∧ (rank‘𝑦) ⊆ (rank‘𝑦)) → ∃𝑥 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦))
4642, 45mpan2 704 . . . . . . . . . 10 (𝑦 ∈ 𝐴 → ∃𝑥 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦))
47 iinss 5017 . . . . . . . . . 10 (∃𝑥 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦) → ∩ 𝑥 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦))
4846, 47syl 18 . . . . . . . . 9 (𝑦 ∈ 𝐴 → ∩ 𝑥 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦))
49 sseq1 3935 . . . . . . . . 9 (∩ 𝑥 ∈ 𝐴 (rank‘𝑥) = (rank‘𝑥) → (∩ 𝑥 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦) ↔ (rank‘𝑥) ⊆ (rank‘𝑦)))
5048, 49imbitrid 247 . . . . . . . 8 (∩ 𝑥 ∈ 𝐴 (rank‘𝑥) = (rank‘𝑥) → (𝑦 ∈ 𝐴 → (rank‘𝑥) ⊆ (rank‘𝑦)))
5150ralrimiv 3158 . . . . . . 7 (∩ 𝑥 ∈ 𝐴 (rank‘𝑥) = (rank‘𝑥) → ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦))
5251reximi 3105 . . . . . 6 (∃𝑥 ∈ 𝐴 ∩ 𝑥 ∈ 𝐴 (rank‘𝑥) = (rank‘𝑥) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦))
5326, 35, 41, 524syl 20 . . . . 5 (𝐴 ≠ ∅ → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦))
54 rabn0 4339 . . . . 5 ({𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)} ≠ ∅ ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦))
5553, 54sylibr 237 . . . 4 (𝐴 ≠ ∅ → {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)} ≠ ∅)
5655necon4i 2995 . . 3 ({𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)} = ∅ → 𝐴 = ∅)
575, 56sylbi 220 . 2 (Scott 𝐴 = ∅ → 𝐴 = ∅)
583, 57impbii 212 1 (𝐴 = ∅ ↔ Scott 𝐴 = ∅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2148  {cab 2742   ≠ wne 2960  ∀wral 3081  ∃wrex 3091  {crab 3413   ⊆ wss 3897  ∅c0 4278  ∩ cint 4909  ∩ ciin 4954  Oncon0 6385  ‘cfv 6563  rankcrnk 9801  Scott cscott 9962
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 2150  ax-9 2158  ax-10 2181  ax-11 2198  ax-12 2217  ax-ext 2736  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7780
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 2568  df-eu 2598  df-clab 2743  df-cleq 2756  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3849  df-ss 3898  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4483  df-pw 4559  df-sn 4586  df-pr 4588  df-op 4838  df-uni 4870  df-int 4910  df-iun 4955  df-iin 4956  df-br 5106  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 6327  df-ord 6388  df-on 6389  df-lim 6390  df-suc 6391  df-iota 6517  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-ov 7451  df-om 7909  df-2nd 8033  df-frecs 8334  df-wrecs 8365  df-recs 8414  df-rdg 8453  df-r1 9802  df-rank 9803  df-scott 9963
This theorem is used by:  scott0bs  9978  scotteld  9981  cplem1  9984  karden  9993  elscottn0  35873  rankscott  35875  erscottd  35880  ecscottd  35881  kardeq0  35961  scott0f  39364
  Copyright terms: Public domain W3C validator