| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > opreu2reurex | Structured version Visualization version GIF version | ||
| Description: There is a unique ordered pair fulfilling a wff iff there are uniquely two sets fulfilling a corresponding wff. (Contributed by AV, 24-Jun-2023.) (Revised by AV, 1-Jul-2023.) |
| Ref | Expression |
|---|---|
| opreu2reurex.a | ⊢ (𝑝 = 〈𝑎, 𝑏〉 → (𝜑 ↔ 𝜒)) |
| Ref | Expression |
|---|---|
| opreu2reurex | ⊢ (∃!𝑝 ∈ (𝐴 × 𝐵)𝜑 ↔ (∃!𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝜒 ∧ ∃!𝑏 ∈ 𝐵 ∃𝑎 ∈ 𝐴 𝜒)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqcom 2773 | . . . . . . . 8 ⊢ (〈𝑥, 𝑦〉 = 〈𝑎, 𝑏〉 ↔ 〈𝑎, 𝑏〉 = 〈𝑥, 𝑦〉) | |
| 2 | vex 3457 | . . . . . . . . 9 ⊢ 𝑎 ∈ V | |
| 3 | vex 3457 | . . . . . . . . 9 ⊢ 𝑏 ∈ V | |
| 4 | 2, 3 | opth 5451 | . . . . . . . 8 ⊢ (〈𝑎, 𝑏〉 = 〈𝑥, 𝑦〉 ↔ (𝑎 = 𝑥 ∧ 𝑏 = 𝑦)) |
| 5 | 1, 4 | bitri 278 | . . . . . . 7 ⊢ (〈𝑥, 𝑦〉 = 〈𝑎, 𝑏〉 ↔ (𝑎 = 𝑥 ∧ 𝑏 = 𝑦)) |
| 6 | 5 | imbi2i 339 | . . . . . 6 ⊢ ((𝜒 → 〈𝑥, 𝑦〉 = 〈𝑎, 𝑏〉) ↔ (𝜒 → (𝑎 = 𝑥 ∧ 𝑏 = 𝑦))) |
| 7 | 6 | a1i 11 | . . . . 5 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵)) → ((𝜒 → 〈𝑥, 𝑦〉 = 〈𝑎, 𝑏〉) ↔ (𝜒 → (𝑎 = 𝑥 ∧ 𝑏 = 𝑦)))) |
| 8 | 7 | 2ralbidva 3228 | . . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 (𝜒 → 〈𝑥, 𝑦〉 = 〈𝑎, 𝑏〉) ↔ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 (𝜒 → (𝑎 = 𝑥 ∧ 𝑏 = 𝑦)))) |
| 9 | 8 | 2rexbiia 3227 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 (𝜒 → 〈𝑥, 𝑦〉 = 〈𝑎, 𝑏〉) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 (𝜒 → (𝑎 = 𝑥 ∧ 𝑏 = 𝑦))) |
| 10 | 9 | anbi2i 635 | . 2 ⊢ ((∃𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝜒 ∧ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 (𝜒 → 〈𝑥, 𝑦〉 = 〈𝑎, 𝑏〉)) ↔ (∃𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝜒 ∧ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 (𝜒 → (𝑎 = 𝑥 ∧ 𝑏 = 𝑦)))) |
| 11 | opreu2reurex.a | . . 3 ⊢ (𝑝 = 〈𝑎, 𝑏〉 → (𝜑 ↔ 𝜒)) | |
| 12 | 11 | reu3op 6320 | . 2 ⊢ (∃!𝑝 ∈ (𝐴 × 𝐵)𝜑 ↔ (∃𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝜒 ∧ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 (𝜒 → 〈𝑥, 𝑦〉 = 〈𝑎, 𝑏〉))) |
| 13 | 2reu4 4482 | . 2 ⊢ ((∃!𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝜒 ∧ ∃!𝑏 ∈ 𝐵 ∃𝑎 ∈ 𝐴 𝜒) ↔ (∃𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝜒 ∧ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 (𝜒 → (𝑎 = 𝑥 ∧ 𝑏 = 𝑦)))) | |
| 14 | 10, 12, 13 | 3bitr4i 306 | 1 ⊢ (∃!𝑝 ∈ (𝐴 × 𝐵)𝜑 ↔ (∃!𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝜒 ∧ ∃!𝑏 ∈ 𝐵 ∃𝑎 ∈ 𝐴 𝜒)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1572 ∈ wcel 2150 ∀wral 3083 ∃wrex 3093 ∃!wreu 3366 〈cop 4839 × cxp 5655 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-sep 5254 ax-pr 5397 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-ral 3084 df-rex 3094 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4840 df-iun 4957 df-opab 5173 df-xp 5663 df-rel 5664 |
| This theorem is used by: opreu2reu 6323 2sqreuop 27848 2sqreuopnn 27849 2sqreuoplt 27850 2sqreuopltb 27851 2sqreuopnnlt 27852 2sqreuopnnltb 27853 opreu2reu1 33181 |
| Copyright terms: Public domain | W3C validator |