Theorem ralndv1 48315

Description: Example for a theorem about a restricted universal quantification in which the restricting class depends on (actually is) the bound variable: All sets containing themselves contain the universal class. (Contributed by AV, 24-Jun-2023.)

Assertion

Ref	Expression
ralndv1	⊢ ∀𝑥 ∈ 𝑥 V ∈ 𝑥

Proof of Theorem ralndv1

Step	Hyp	Ref	Expression
1		elirrv 9601	. . 3 ⊢ ¬ 𝑥 ∈ 𝑥
2	1	pm2.21i 120	. 2 ⊢ (𝑥 ∈ 𝑥 → V ∈ 𝑥)
3	2	rgen 3081	1 ⊢ ∀𝑥 ∈ 𝑥 V ∈ 𝑥

This proof depends on syntax axioms:   ∈ wcel 2146  ∀wral 3079  Vcvv 3453

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-sep 5251  ax-reg 9596

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812  df-ral 3080

This theorem is used by: (None)