![]() |
Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > ralndv2 | Structured version Visualization version GIF version |
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.) |
Ref | Expression |
---|---|
ralndv2 | ⊢ ∀𝑥 ∈ 𝒫 𝑥𝑥 ∈ V |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | vex 3472 | . 2 ⊢ 𝑥 ∈ V | |
2 | 1 | rgenw 3059 | 1 ⊢ ∀𝑥 ∈ 𝒫 𝑥𝑥 ∈ V |
Colors of variables: wff setvar class |
Syntax hints: ∈ wcel 2098 ∀wral 3055 Vcvv 3468 𝒫 cpw 4597 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-ext 2697 |
This theorem depends on definitions: df-bi 206 df-an 396 df-tru 1536 df-ex 1774 df-sb 2060 df-clab 2704 df-cleq 2718 df-clel 2804 df-ral 3056 df-v 3470 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |