Theorem ralndv2 47111

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 3454	. 2 ⊢ 𝑥 ∈ V
2	1	rgenw 3049	1 ⊢ ∀𝑥 ∈ 𝒫 𝑥𝑥 ∈ V

Syntax hints:   ∈ wcel 2109  ∀wral 3045  Vcvv 3450  𝒫 cpw 4566

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2702

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1543  df-ex 1780  df-sb 2066  df-clab 2709  df-cleq 2722  df-clel 2804  df-ral 3046  df-v 3452

This theorem is referenced by: (None)