Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > uniexr | Structured version Visualization version GIF version |
Description: Converse of the Axiom of Union. Note that it does not require ax-un 7463. (Contributed by NM, 11-Nov-2003.) |
Ref | Expression |
---|---|
uniexr | ⊢ (∪ 𝐴 ∈ 𝑉 → 𝐴 ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | pwuni 4877 | . 2 ⊢ 𝐴 ⊆ 𝒫 ∪ 𝐴 | |
2 | pwexg 5281 | . 2 ⊢ (∪ 𝐴 ∈ 𝑉 → 𝒫 ∪ 𝐴 ∈ V) | |
3 | ssexg 5229 | . 2 ⊢ ((𝐴 ⊆ 𝒫 ∪ 𝐴 ∧ 𝒫 ∪ 𝐴 ∈ V) → 𝐴 ∈ V) | |
4 | 1, 2, 3 | sylancr 589 | 1 ⊢ (∪ 𝐴 ∈ 𝑉 → 𝐴 ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∈ wcel 2114 Vcvv 3496 ⊆ wss 3938 𝒫 cpw 4541 ∪ cuni 4840 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-pow 5268 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-rab 3149 df-v 3498 df-in 3945 df-ss 3954 df-pw 4543 df-uni 4841 |
This theorem is referenced by: uniexb 7488 ssonprc 7509 ac5num 9464 bj-restv 34388 bj-mooreset 34396 |
Copyright terms: Public domain | W3C validator |