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

Theorem abnex 7462
 Description: Sufficient condition for a class abstraction to be a proper class. Lemma for snnex 7463 and pwnex 7464. See the comment of abnexg 7461. (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 5200 . 2 ¬ V ∈ V
2 alral 3148 . . 3 (∀𝑥(𝐹𝑉𝑥𝐹) → ∀𝑥 ∈ V (𝐹𝑉𝑥𝐹))
3 rexv 3505 . . . . . . 7 (∃𝑥 ∈ V 𝑦 = 𝐹 ↔ ∃𝑥 𝑦 = 𝐹)
43bicomi 227 . . . . . 6 (∃𝑥 𝑦 = 𝐹 ↔ ∃𝑥 ∈ V 𝑦 = 𝐹)
54abbii 2889 . . . . 5 {𝑦 ∣ ∃𝑥 𝑦 = 𝐹} = {𝑦 ∣ ∃𝑥 ∈ V 𝑦 = 𝐹}
65eleq1i 2906 . . . 4 ({𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V ↔ {𝑦 ∣ ∃𝑥 ∈ V 𝑦 = 𝐹} ∈ V)
76biimpi 219 . . 3 ({𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V → {𝑦 ∣ ∃𝑥 ∈ V 𝑦 = 𝐹} ∈ V)
8 abnexg 7461 . . 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 2115  {cab 2802  ∀wral 3132  ∃wrex 3133  Vcvv 3479 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 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2179  ax-ext 2796  ax-sep 5184  ax-un 7444 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 2071  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2964  df-ral 3137  df-rex 3138  df-rab 3141  df-v 3481  df-in 3925  df-ss 3935  df-sn 4549  df-uni 4820  df-iun 4902 This theorem is referenced by:  snnex  7463  pwnex  7464
 Copyright terms: Public domain W3C validator