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

Theorem scott0bsOLD 9979
Description: Obsolete version of scott0bs 9978 as of 19-Jul-2026. (Contributed by NM, 13-Oct-2003.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
scott0bsOLD (∃𝑥𝜑 ↔ {𝑥 ∣ (𝜑 ∧ ∀𝑦([𝑦 / 𝑥]𝜑 → (rank‘𝑥) ⊆ (rank‘𝑦)))} ≠ ∅)
Distinct variable groups:   𝑥,𝑦   𝜑,𝑦
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem scott0bsOLD
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 abn0 4334 . 2 ({𝑥 ∣ 𝜑} ≠ ∅ ↔ ∃𝑥𝜑)
2 scott0OLD 9972 . . . 4 ({𝑥 ∣ 𝜑} = ∅ ↔ {𝑧 ∈ {𝑥 ∣ 𝜑} ∣ ∀𝑦 ∈ {𝑥 ∣ 𝜑} (rank‘𝑧) ⊆ (rank‘𝑦)} = ∅)
3 nfcv 2927 . . . . . . 7 Ⅎ𝑧{𝑥 ∣ 𝜑}
4 nfab1 2929 . . . . . . 7 Ⅎ𝑥{𝑥 ∣ 𝜑}
5 nfv 1949 . . . . . . . 8 Ⅎ𝑥(rank‘𝑧) ⊆ (rank‘𝑦)
64, 5nfralw 3311 . . . . . . 7 Ⅎ𝑥∀𝑦 ∈ {𝑥 ∣ 𝜑} (rank‘𝑧) ⊆ (rank‘𝑦)
7 nfv 1949 . . . . . . 7 Ⅎ𝑧∀𝑦 ∈ {𝑥 ∣ 𝜑} (rank‘𝑥) ⊆ (rank‘𝑦)
8 fveq2 6913 . . . . . . . . 9 (𝑧 = 𝑥 → (rank‘𝑧) = (rank‘𝑥))
98sseq1d 3941 . . . . . . . 8 (𝑧 = 𝑥 → ((rank‘𝑧) ⊆ (rank‘𝑦) ↔ (rank‘𝑥) ⊆ (rank‘𝑦)))
109ralbidv 3190 . . . . . . 7 (𝑧 = 𝑥 → (∀𝑦 ∈ {𝑥 ∣ 𝜑} (rank‘𝑧) ⊆ (rank‘𝑦) ↔ ∀𝑦 ∈ {𝑥 ∣ 𝜑} (rank‘𝑥) ⊆ (rank‘𝑦)))
113, 4, 6, 7, 10cbvrabw 3447 . . . . . 6 {𝑧 ∈ {𝑥 ∣ 𝜑} ∣ ∀𝑦 ∈ {𝑥 ∣ 𝜑} (rank‘𝑧) ⊆ (rank‘𝑦)} = {𝑥 ∈ {𝑥 ∣ 𝜑} ∣ ∀𝑦 ∈ {𝑥 ∣ 𝜑} (rank‘𝑥) ⊆ (rank‘𝑦)}
12 df-rab 3414 . . . . . 6 {𝑥 ∈ {𝑥 ∣ 𝜑} ∣ ∀𝑦 ∈ {𝑥 ∣ 𝜑} (rank‘𝑥) ⊆ (rank‘𝑦)} = {𝑥 ∣ (𝑥 ∈ {𝑥 ∣ 𝜑} ∧ ∀𝑦 ∈ {𝑥 ∣ 𝜑} (rank‘𝑥) ⊆ (rank‘𝑦))}
13 abid 2746 . . . . . . . 8 (𝑥 ∈ {𝑥 ∣ 𝜑} ↔ 𝜑)
14 df-ral 3082 . . . . . . . . 9 (∀𝑦 ∈ {𝑥 ∣ 𝜑} (rank‘𝑥) ⊆ (rank‘𝑦) ↔ ∀𝑦(𝑦 ∈ {𝑥 ∣ 𝜑} → (rank‘𝑥) ⊆ (rank‘𝑦)))
15 df-sbc 3740 . . . . . . . . . . 11 ([𝑦 / 𝑥]𝜑 ↔ 𝑦 ∈ {𝑥 ∣ 𝜑})
1615imbi1i 352 . . . . . . . . . 10 (([𝑦 / 𝑥]𝜑 → (rank‘𝑥) ⊆ (rank‘𝑦)) ↔ (𝑦 ∈ {𝑥 ∣ 𝜑} → (rank‘𝑥) ⊆ (rank‘𝑦)))
1716albii 1852 . . . . . . . . 9 (∀𝑦([𝑦 / 𝑥]𝜑 → (rank‘𝑥) ⊆ (rank‘𝑦)) ↔ ∀𝑦(𝑦 ∈ {𝑥 ∣ 𝜑} → (rank‘𝑥) ⊆ (rank‘𝑦)))
1814, 17bitr4i 281 . . . . . . . 8 (∀𝑦 ∈ {𝑥 ∣ 𝜑} (rank‘𝑥) ⊆ (rank‘𝑦) ↔ ∀𝑦([𝑦 / 𝑥]𝜑 → (rank‘𝑥) ⊆ (rank‘𝑦)))
1913, 18anbi12i 640 . . . . . . 7 ((𝑥 ∈ {𝑥 ∣ 𝜑} ∧ ∀𝑦 ∈ {𝑥 ∣ 𝜑} (rank‘𝑥) ⊆ (rank‘𝑦)) ↔ (𝜑 ∧ ∀𝑦([𝑦 / 𝑥]𝜑 → (rank‘𝑥) ⊆ (rank‘𝑦))))
2019abbii 2831 . . . . . 6 {𝑥 ∣ (𝑥 ∈ {𝑥 ∣ 𝜑} ∧ ∀𝑦 ∈ {𝑥 ∣ 𝜑} (rank‘𝑥) ⊆ (rank‘𝑦))} = {𝑥 ∣ (𝜑 ∧ ∀𝑦([𝑦 / 𝑥]𝜑 → (rank‘𝑥) ⊆ (rank‘𝑦)))}
2111, 12, 203eqtri 2791 . . . . 5 {𝑧 ∈ {𝑥 ∣ 𝜑} ∣ ∀𝑦 ∈ {𝑥 ∣ 𝜑} (rank‘𝑧) ⊆ (rank‘𝑦)} = {𝑥 ∣ (𝜑 ∧ ∀𝑦([𝑦 / 𝑥]𝜑 → (rank‘𝑥) ⊆ (rank‘𝑦)))}
2221eqeq1i 2769 . . . 4 ({𝑧 ∈ {𝑥 ∣ 𝜑} ∣ ∀𝑦 ∈ {𝑥 ∣ 𝜑} (rank‘𝑧) ⊆ (rank‘𝑦)} = ∅ ↔ {𝑥 ∣ (𝜑 ∧ ∀𝑦([𝑦 / 𝑥]𝜑 → (rank‘𝑥) ⊆ (rank‘𝑦)))} = ∅)
232, 22bitri 278 . . 3 ({𝑥 ∣ 𝜑} = ∅ ↔ {𝑥 ∣ (𝜑 ∧ ∀𝑦([𝑦 / 𝑥]𝜑 → (rank‘𝑥) ⊆ (rank‘𝑦)))} = ∅)
2423necon3bii 3012 . 2 ({𝑥 ∣ 𝜑} ≠ ∅ ↔ {𝑥 ∣ (𝜑 ∧ ∀𝑦([𝑦 / 𝑥]𝜑 → (rank‘𝑥) ⊆ (rank‘𝑦)))} ≠ ∅)
251, 24bitr3i 280 1 (∃𝑥𝜑 ↔ {𝑥 ∣ (𝜑 ∧ ∀𝑦([𝑦 / 𝑥]𝜑 → (rank‘𝑥) ⊆ (rank‘𝑦)))} ≠ ∅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2148  {cab 2742   ≠ wne 2960  ∀wral 3081  {crab 3413  [wsbc 3739   ⊆ wss 3897  ∅c0 4278  ‘cfv 6563  rankcrnk 9801
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
This theorem is used by:  htaOLD  9997
  Copyright terms: Public domain W3C validator