![]() |
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 4201 | . 2 ⊢ 𝐴 ⊆ (𝐴 ∪ 𝐵) | |
2 | orc 866 | . . 3 ⊢ (𝜑 → (𝜑 ∨ 𝜓)) | |
3 | 2 | rgenw 3071 | . 2 ⊢ ∀𝑥 ∈ 𝐴 (𝜑 → (𝜑 ∨ 𝜓)) |
4 | reuss2 4345 | . 2 ⊢ (((𝐴 ⊆ (𝐴 ∪ 𝐵) ∧ ∀𝑥 ∈ 𝐴 (𝜑 → (𝜑 ∨ 𝜓))) ∧ (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃!𝑥 ∈ (𝐴 ∪ 𝐵)(𝜑 ∨ 𝜓))) → ∃!𝑥 ∈ 𝐴 𝜑) | |
5 | 1, 3, 4 | mpanl12 701 | 1 ⊢ ((∃𝑥 ∈ 𝐴 𝜑 ∧ ∃!𝑥 ∈ (𝐴 ∪ 𝐵)(𝜑 ∨ 𝜓)) → ∃!𝑥 ∈ 𝐴 𝜑) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∨ wo 846 ∀wral 3067 ∃wrex 3076 ∃!wreu 3386 ∪ cun 3974 ⊆ wss 3976 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2711 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-tru 1540 df-ex 1778 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-ral 3068 df-rex 3077 df-reu 3389 df-v 3490 df-un 3981 df-ss 3993 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |