| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 2reu5lem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for 2reu5 3730. Note that ∃!𝑥 ∈ 𝐴∃!𝑦 ∈ 𝐵𝜑 does not mean "there is exactly one 𝑥 in 𝐴 and exactly one 𝑦 in 𝐵 such that 𝜑 holds"; see comment for 2eu5 2689. (Contributed by Alexander van der Vekens, 17-Jun-2017.) |
| Ref | Expression |
|---|---|
| 2reu5lem1 | ⊢ (∃!𝑥 ∈ 𝐴 ∃!𝑦 ∈ 𝐵 𝜑 ↔ ∃!𝑥∃!𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-reu 3377 | . . 3 ⊢ (∃!𝑦 ∈ 𝐵 𝜑 ↔ ∃!𝑦(𝑦 ∈ 𝐵 ∧ 𝜑)) | |
| 2 | 1 | reubii 3385 | . 2 ⊢ (∃!𝑥 ∈ 𝐴 ∃!𝑦 ∈ 𝐵 𝜑 ↔ ∃!𝑥 ∈ 𝐴 ∃!𝑦(𝑦 ∈ 𝐵 ∧ 𝜑)) |
| 3 | df-reu 3377 | . . 3 ⊢ (∃!𝑥 ∈ 𝐴 ∃!𝑦(𝑦 ∈ 𝐵 ∧ 𝜑) ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ ∃!𝑦(𝑦 ∈ 𝐵 ∧ 𝜑))) | |
| 4 | euanv 2658 | . . . . . 6 ⊢ (∃!𝑦(𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐵 ∧ 𝜑)) ↔ (𝑥 ∈ 𝐴 ∧ ∃!𝑦(𝑦 ∈ 𝐵 ∧ 𝜑))) | |
| 5 | 4 | bicomi 227 | . . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ ∃!𝑦(𝑦 ∈ 𝐵 ∧ 𝜑)) ↔ ∃!𝑦(𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐵 ∧ 𝜑))) |
| 6 | 3anass 1109 | . . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝜑) ↔ (𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐵 ∧ 𝜑))) | |
| 7 | 6 | bicomi 227 | . . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐵 ∧ 𝜑)) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝜑)) |
| 8 | 7 | eubii 2619 | . . . . 5 ⊢ (∃!𝑦(𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐵 ∧ 𝜑)) ↔ ∃!𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝜑)) |
| 9 | 5, 8 | bitri 278 | . . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ ∃!𝑦(𝑦 ∈ 𝐵 ∧ 𝜑)) ↔ ∃!𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝜑)) |
| 10 | 9 | eubii 2619 | . . 3 ⊢ (∃!𝑥(𝑥 ∈ 𝐴 ∧ ∃!𝑦(𝑦 ∈ 𝐵 ∧ 𝜑)) ↔ ∃!𝑥∃!𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝜑)) |
| 11 | 3, 10 | bitri 278 | . 2 ⊢ (∃!𝑥 ∈ 𝐴 ∃!𝑦(𝑦 ∈ 𝐵 ∧ 𝜑) ↔ ∃!𝑥∃!𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝜑)) |
| 12 | 2, 11 | bitri 278 | 1 ⊢ (∃!𝑥 ∈ 𝐴 ∃!𝑦 ∈ 𝐵 𝜑 ↔ ∃!𝑥∃!𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝜑)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 ∧ wa 400 ∧ w3a 1101 ∈ wcel 2149 ∃!weu 2602 ∃!wreu 3374 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-3an 1103 df-ex 1807 df-mo 2573 df-eu 2603 df-reu 3377 |
| This theorem is referenced by: 2reu5lem3 3729 |
| Copyright terms: Public domain | W3C validator |