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

Theorem abnex 7459
Description: Sufficient condition for a class abstraction to be a proper class. Lemma for snnex 7460 and pwnex 7461. See the comment of abnexg 7458. (Contributed by BJ, 2-May-2021.)
Assertion
Ref Expression
abnex (∀𝑥(𝐹𝑉𝑥𝐹) → ¬ {𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V)
Distinct variable groups:   𝑥,𝑦   𝑦,𝐹
Allowed substitution hints:   𝐹(𝑥)   𝑉(𝑥,𝑦)

Proof of Theorem abnex
StepHypRef Expression
1 vprc 5183 . 2 ¬ V ∈ V
2 alral 3122 . . 3 (∀𝑥(𝐹𝑉𝑥𝐹) → ∀𝑥 ∈ V (𝐹𝑉𝑥𝐹))
3 rexv 3467 . . . . . . 7 (∃𝑥 ∈ V 𝑦 = 𝐹 ↔ ∃𝑥 𝑦 = 𝐹)
43bicomi 227 . . . . . 6 (∃𝑥 𝑦 = 𝐹 ↔ ∃𝑥 ∈ V 𝑦 = 𝐹)
54abbii 2863 . . . . 5 {𝑦 ∣ ∃𝑥 𝑦 = 𝐹} = {𝑦 ∣ ∃𝑥 ∈ V 𝑦 = 𝐹}
65eleq1i 2880 . . . 4 ({𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V ↔ {𝑦 ∣ ∃𝑥 ∈ V 𝑦 = 𝐹} ∈ V)
76biimpi 219 . . 3 ({𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V → {𝑦 ∣ ∃𝑥 ∈ V 𝑦 = 𝐹} ∈ V)
8 abnexg 7458 . . 3 (∀𝑥 ∈ V (𝐹𝑉𝑥𝐹) → ({𝑦 ∣ ∃𝑥 ∈ V 𝑦 = 𝐹} ∈ V → V ∈ V))
92, 7, 8syl2im 40 . 2 (∀𝑥(𝐹𝑉𝑥𝐹) → ({𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V → V ∈ V))
101, 9mtoi 202 1 (∀𝑥(𝐹𝑉𝑥𝐹) → ¬ {𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 399  wal 1536   = wceq 1538  wex 1781  wcel 2111  {cab 2776  wral 3106  wrex 3107  Vcvv 3441
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-un 7441
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-in 3888  df-ss 3898  df-sn 4526  df-uni 4801  df-iun 4883
This theorem is referenced by:  snnex  7460  pwnex  7461
  Copyright terms: Public domain W3C validator