![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > reuun1 | Structured version Visualization version GIF version |
Description: Transfer uniqueness to a smaller class. (Contributed by NM, 21-Oct-2005.) |
Ref | Expression |
---|---|
reuun1 | ⊢ ((∃𝑥 ∈ 𝐴 𝜑 ∧ ∃!𝑥 ∈ (𝐴 ∪ 𝐵)(𝜑 ∨ 𝜓)) → ∃!𝑥 ∈ 𝐴 𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssun1 4099 | . 2 ⊢ 𝐴 ⊆ (𝐴 ∪ 𝐵) | |
2 | orc 864 | . . 3 ⊢ (𝜑 → (𝜑 ∨ 𝜓)) | |
3 | 2 | rgenw 3118 | . 2 ⊢ ∀𝑥 ∈ 𝐴 (𝜑 → (𝜑 ∨ 𝜓)) |
4 | reuss2 4235 | . 2 ⊢ (((𝐴 ⊆ (𝐴 ∪ 𝐵) ∧ ∀𝑥 ∈ 𝐴 (𝜑 → (𝜑 ∨ 𝜓))) ∧ (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃!𝑥 ∈ (𝐴 ∪ 𝐵)(𝜑 ∨ 𝜓))) → ∃!𝑥 ∈ 𝐴 𝜑) | |
5 | 1, 3, 4 | mpanl12 701 | 1 ⊢ ((∃𝑥 ∈ 𝐴 𝜑 ∧ ∃!𝑥 ∈ (𝐴 ∪ 𝐵)(𝜑 ∨ 𝜓)) → ∃!𝑥 ∈ 𝐴 𝜑) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 ∨ wo 844 ∀wral 3106 ∃wrex 3107 ∃!wreu 3108 ∪ cun 3879 ⊆ wss 3881 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-ex 1782 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-ral 3111 df-rex 3112 df-reu 3113 df-v 3443 df-un 3886 df-in 3888 df-ss 3898 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |