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

Theorem abnex 7711
Description: Sufficient condition for a class abstraction to be a proper class. Lemma for snnex 7712 and pwnex 7713. See the comment of abnexg 7710. (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 5255 . 2 ¬ V ∈ V
2 alral 3066 . . 3 (∀𝑥(𝐹𝑉𝑥𝐹) → ∀𝑥 ∈ V (𝐹𝑉𝑥𝐹))
3 rexv 3457 . . . . . . 7 (∃𝑥 ∈ V 𝑦 = 𝐹 ↔ ∃𝑥 𝑦 = 𝐹)
43bicomi 224 . . . . . 6 (∃𝑥 𝑦 = 𝐹 ↔ ∃𝑥 ∈ V 𝑦 = 𝐹)
54abbii 2803 . . . . 5 {𝑦 ∣ ∃𝑥 𝑦 = 𝐹} = {𝑦 ∣ ∃𝑥 ∈ V 𝑦 = 𝐹}
65eleq1i 2827 . . . 4 ({𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V ↔ {𝑦 ∣ ∃𝑥 ∈ V 𝑦 = 𝐹} ∈ V)
76biimpi 216 . . 3 ({𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V → {𝑦 ∣ ∃𝑥 ∈ V 𝑦 = 𝐹} ∈ V)
8 abnexg 7710 . . 3 (∀𝑥 ∈ V (𝐹𝑉𝑥𝐹) → ({𝑦 ∣ ∃𝑥 ∈ V 𝑦 = 𝐹} ∈ V → V ∈ V))
92, 7, 8syl2im 40 . 2 (∀𝑥(𝐹𝑉𝑥𝐹) → ({𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V → V ∈ V))
101, 9mtoi 199 1 (∀𝑥(𝐹𝑉𝑥𝐹) → ¬ {𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395  wal 1540   = wceq 1542  wex 1781  wcel 2114  {cab 2714  wral 3051  wrex 3061  Vcvv 3429
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 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-11 2163  ax-ext 2708  ax-sep 5231  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-3an 1089  df-tru 1545  df-ex 1782  df-sb 2069  df-clab 2715  df-cleq 2728  df-clel 2811  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-in 3896  df-ss 3906  df-sn 4568  df-uni 4851  df-iun 4935
This theorem is referenced by:  snnex  7712  pwnex  7713
  Copyright terms: Public domain W3C validator