| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > reurexprg | Structured version Visualization version GIF version | ||
| Description: Convert a restricted existential uniqueness over a pair to a restricted existential quantification and an implication . (Contributed by AV, 3-Apr-2023.) |
| Ref | Expression |
|---|---|
| reuprg.1 | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) |
| reuprg.2 | ⊢ (𝑥 = 𝐵 → (𝜑 ↔ 𝜒)) |
| Ref | Expression |
|---|---|
| reurexprg | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∃!𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ (∃𝑥 ∈ {𝐴, 𝐵}𝜑 ∧ ((𝜒 ∧ 𝜓) → 𝐴 = 𝐵)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | reuprg.1 | . . 3 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
| 2 | reuprg.2 | . . 3 ⊢ (𝑥 = 𝐵 → (𝜑 ↔ 𝜒)) | |
| 3 | 1, 2 | reuprg 4642 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∃!𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ ((𝜓 ∨ 𝜒) ∧ ((𝜒 ∧ 𝜓) → 𝐴 = 𝐵)))) |
| 4 | 1, 2 | rexprg 4636 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∃𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ (𝜓 ∨ 𝜒))) |
| 5 | 4 | bicomd 224 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((𝜓 ∨ 𝜒) ↔ ∃𝑥 ∈ {𝐴, 𝐵}𝜑)) |
| 6 | 5 | anbi1d 637 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (((𝜓 ∨ 𝜒) ∧ ((𝜒 ∧ 𝜓) → 𝐴 = 𝐵)) ↔ (∃𝑥 ∈ {𝐴, 𝐵}𝜑 ∧ ((𝜒 ∧ 𝜓) → 𝐴 = 𝐵)))) |
| 7 | 3, 6 | bitrd 280 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∃!𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ (∃𝑥 ∈ {𝐴, 𝐵}𝜑 ∧ ((𝜒 ∧ 𝜓) → 𝐴 = 𝐵)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 ∨ wo 853 = wceq 1547 ∈ wcel 2119 ∃wrex 3064 ∃!wreu 3343 {cpr 4564 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ral 3055 df-rex 3065 df-rmo 3345 df-reu 3346 df-v 3434 df-sbc 3731 df-un 3895 df-sn 4563 df-pr 4565 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |