Mathbox for Emmett Weisz |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > vsetrec | Structured version Visualization version GIF version |
Description: Construct V using set recursion. The proof indirectly uses trcl 8487, which relies on rec, but theoretically 𝐶 in trcl 8487 could be constructed using setrecs instead. The proof of this theorem uses the dummy variable 𝑎 rather than 𝑥 to avoid a distinct variable requirement between 𝐹 and 𝑥. (Contributed by Emmett Weisz, 23-Jun-2021.) |
Ref | Expression |
---|---|
vsetrec.1 | ⊢ 𝐹 = (𝑥 ∈ V ↦ 𝒫 𝑥) |
Ref | Expression |
---|---|
vsetrec | ⊢ setrecs(𝐹) = V |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | setind 8493 | . 2 ⊢ (∀𝑎(𝑎 ⊆ setrecs(𝐹) → 𝑎 ∈ setrecs(𝐹)) → setrecs(𝐹) = V) | |
2 | vex 3176 | . . . 4 ⊢ 𝑎 ∈ V | |
3 | 2 | pwid 4122 | . . 3 ⊢ 𝑎 ∈ 𝒫 𝑎 |
4 | pweq 4111 | . . . . . . 7 ⊢ (𝑥 = 𝑎 → 𝒫 𝑥 = 𝒫 𝑎) | |
5 | vsetrec.1 | . . . . . . 7 ⊢ 𝐹 = (𝑥 ∈ V ↦ 𝒫 𝑥) | |
6 | 2 | pwex 4774 | . . . . . . 7 ⊢ 𝒫 𝑎 ∈ V |
7 | 4, 5, 6 | fvmpt 6191 | . . . . . 6 ⊢ (𝑎 ∈ V → (𝐹‘𝑎) = 𝒫 𝑎) |
8 | 2, 7 | ax-mp 5 | . . . . 5 ⊢ (𝐹‘𝑎) = 𝒫 𝑎 |
9 | eqid 2610 | . . . . . 6 ⊢ setrecs(𝐹) = setrecs(𝐹) | |
10 | 2 | a1i 11 | . . . . . 6 ⊢ (𝑎 ⊆ setrecs(𝐹) → 𝑎 ∈ V) |
11 | id 22 | . . . . . 6 ⊢ (𝑎 ⊆ setrecs(𝐹) → 𝑎 ⊆ setrecs(𝐹)) | |
12 | 9, 10, 11 | setrec1 42237 | . . . . 5 ⊢ (𝑎 ⊆ setrecs(𝐹) → (𝐹‘𝑎) ⊆ setrecs(𝐹)) |
13 | 8, 12 | syl5eqssr 3613 | . . . 4 ⊢ (𝑎 ⊆ setrecs(𝐹) → 𝒫 𝑎 ⊆ setrecs(𝐹)) |
14 | 13 | sseld 3567 | . . 3 ⊢ (𝑎 ⊆ setrecs(𝐹) → (𝑎 ∈ 𝒫 𝑎 → 𝑎 ∈ setrecs(𝐹))) |
15 | 3, 14 | mpi 20 | . 2 ⊢ (𝑎 ⊆ setrecs(𝐹) → 𝑎 ∈ setrecs(𝐹)) |
16 | 1, 15 | mpg 1715 | 1 ⊢ setrecs(𝐹) = V |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1475 ∈ wcel 1977 Vcvv 3173 ⊆ wss 3540 𝒫 cpw 4108 ↦ cmpt 4643 ‘cfv 5804 setrecscsetrecs 42229 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-reg 8380 ax-inf2 8421 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-iin 4458 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-om 6958 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-r1 8510 df-rank 8511 df-setrecs 42230 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |