| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > copsex2gb | Structured version Visualization version GIF version | ||
| Description: Implicit substitution inference for ordered pairs. Compare copsex2ga 5794. (Contributed by NM, 12-Mar-2014.) |
| Ref | Expression |
|---|---|
| copsex2ga.1 | ⊢ (𝐴 = 〈𝑥, 𝑦〉 → (𝜑 ↔ 𝜓)) |
| Ref | Expression |
|---|---|
| copsex2gb | ⊢ (∃𝑥∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ 𝜓) ↔ (𝐴 ∈ (V × V) ∧ 𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elvv 5736 | . . 3 ⊢ (𝐴 ∈ (V × V) ↔ ∃𝑥∃𝑦 𝐴 = 〈𝑥, 𝑦〉) | |
| 2 | 1 | anbi1i 635 | . 2 ⊢ ((𝐴 ∈ (V × V) ∧ 𝜑) ↔ (∃𝑥∃𝑦 𝐴 = 〈𝑥, 𝑦〉 ∧ 𝜑)) |
| 3 | 19.41vv 1978 | . 2 ⊢ (∃𝑥∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ (∃𝑥∃𝑦 𝐴 = 〈𝑥, 𝑦〉 ∧ 𝜑)) | |
| 4 | copsex2ga.1 | . . . 4 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → (𝜑 ↔ 𝜓)) | |
| 5 | 4 | pm5.32i 584 | . . 3 ⊢ ((𝐴 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ (𝐴 = 〈𝑥, 𝑦〉 ∧ 𝜓)) |
| 6 | 5 | 2exbii 1877 | . 2 ⊢ (∃𝑥∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑥∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ 𝜓)) |
| 7 | 2, 3, 6 | 3bitr2ri 303 | 1 ⊢ (∃𝑥∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ 𝜓) ↔ (𝐴 ∈ (V × V) ∧ 𝜑)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1568 ∃wex 1807 ∈ wcel 2141 Vcvv 3453 〈cop 4594 × cxp 5659 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2143 ax-9 2151 ax-ext 2733 ax-sep 5256 ax-pr 5404 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1571 df-ex 1808 df-sb 2095 df-clab 2740 df-cleq 2753 df-clel 2836 df-rab 3415 df-v 3455 df-un 3909 df-in 3911 df-ss 3921 df-sn 4589 df-pr 4591 df-op 4595 df-opab 5173 df-xp 5667 |
| This theorem is referenced by: copsex2ga 5794 elopaba 5795 dfxrn2 39002 elcnvlem 44297 |
| Copyright terms: Public domain | W3C validator |