Theorem abnex 4449

Description: Sufficient condition for a class abstraction to be a proper class. Lemma for snnex 4450 and pwnex 4451. See the comment of abnexg 4448. (Contributed by BJ, 2-May-2021.)

Assertion

Ref	Expression
abnex	⊢ (∀𝑥(𝐹 ∈ 𝑉 ∧ 𝑥 ∈ 𝐹) → ¬ {𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V)

Distinct variable groups:   𝑥,𝑦   𝑦,𝐹

Allowed substitution hints:   𝐹(𝑥)   𝑉(𝑥,𝑦)

Proof of Theorem abnex

Step	Hyp	Ref	Expression
1		vprc 4137	. 2 ⊢ ¬ V ∈ V
2		alral 2522	. . 3 ⊢ (∀𝑥(𝐹 ∈ 𝑉 ∧ 𝑥 ∈ 𝐹) → ∀𝑥 ∈ V (𝐹 ∈ 𝑉 ∧ 𝑥 ∈ 𝐹))
3		rexv 2757	. . . . . . 7 ⊢ (∃𝑥 ∈ V 𝑦 = 𝐹 ↔ ∃𝑥 𝑦 = 𝐹)
4	3	bicomi 132	. . . . . 6 ⊢ (∃𝑥 𝑦 = 𝐹 ↔ ∃𝑥 ∈ V 𝑦 = 𝐹)
5	4	abbii 2293	. . . . 5 ⊢ {𝑦 ∣ ∃𝑥 𝑦 = 𝐹} = {𝑦 ∣ ∃𝑥 ∈ V 𝑦 = 𝐹}
6	5	eleq1i 2243	. . . 4 ⊢ ({𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V ↔ {𝑦 ∣ ∃𝑥 ∈ V 𝑦 = 𝐹} ∈ V)
7	6	biimpi 120	. . 3 ⊢ ({𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V → {𝑦 ∣ ∃𝑥 ∈ V 𝑦 = 𝐹} ∈ V)
8		abnexg 4448	. . 3 ⊢ (∀𝑥 ∈ V (𝐹 ∈ 𝑉 ∧ 𝑥 ∈ 𝐹) → ({𝑦 ∣ ∃𝑥 ∈ V 𝑦 = 𝐹} ∈ V → V ∈ V))
9	2, 7, 8	syl2im 38	. 2 ⊢ (∀𝑥(𝐹 ∈ 𝑉 ∧ 𝑥 ∈ 𝐹) → ({𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V → V ∈ V))
10	1, 9	mtoi 664	1 ⊢ (∀𝑥(𝐹 ∈ 𝑉 ∧ 𝑥 ∈ 𝐹) → ¬ {𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104  ∀wal 1351   = wceq 1353  ∃wex 1492   ∈ wcel 2148  {cab 2163  ∀wral 2455  ∃wrex 2456  Vcvv 2739

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-un 4435

This theorem depends on definitions:  df-bi 117  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2741  df-in 3137  df-ss 3144  df-sn 3600  df-uni 3812  df-iun 3890

This theorem is referenced by:  pwnex  4451