Theorem ralndv2 47731

Description: Second example for a theorem about a restricted universal quantification in which the restricting class depends on the bound variable: all subsets of a set are sets. (Contributed by AV, 24-Jun-2023.)

Assertion

Ref	Expression
ralndv2	⊢ ∀𝑥 ∈ 𝒫 𝑥𝑥 ∈ V

Proof of Theorem ralndv2

Step	Hyp	Ref	Expression
1		vex 3467	. 2 ⊢ 𝑥 ∈ V
2	1	rgenw 3089	1 ⊢ ∀𝑥 ∈ 𝒫 𝑥𝑥 ∈ V

Syntax hints:   ∈ wcel 2149  ∀wral 3085  Vcvv 3463  𝒫 cpw 4567

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741

This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1570  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ral 3086  df-v 3465

This theorem is referenced by: (None)