| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > copsex2dv | Structured version Visualization version GIF version | ||
| Description: Implicit substitution deduction for ordered pairs. (Contributed by Thierry Arnoux, 4-May-2025.) |
| Ref | Expression |
|---|---|
| copsex2dv.a | ⊢ (𝜑 → 𝐴 ∈ 𝑈) |
| copsex2dv.b | ⊢ (𝜑 → 𝐵 ∈ 𝑉) |
| copsex2dv.1 | ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → (𝜓 ↔ 𝜒)) |
| Ref | Expression |
|---|---|
| copsex2dv | ⊢ (𝜑 → (∃𝑥∃𝑦(〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉 ∧ 𝜓) ↔ 𝜒)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | copsex2dv.1 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → (𝜓 ↔ 𝜒)) | |
| 2 | 1 | ex 412 | . . 3 ⊢ (𝜑 → ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝜓 ↔ 𝜒))) |
| 3 | 2 | alrimivv 1929 | . 2 ⊢ (𝜑 → ∀𝑥∀𝑦((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝜓 ↔ 𝜒))) |
| 4 | copsex2dv.a | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝑈) | |
| 5 | copsex2dv.b | . 2 ⊢ (𝜑 → 𝐵 ∈ 𝑉) | |
| 6 | copsex2t 5430 | . 2 ⊢ ((∀𝑥∀𝑦((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝜓 ↔ 𝜒)) ∧ (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉)) → (∃𝑥∃𝑦(〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉 ∧ 𝜓) ↔ 𝜒)) | |
| 7 | 3, 4, 5, 6 | syl12anc 836 | 1 ⊢ (𝜑 → (∃𝑥∃𝑦(〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉 ∧ 𝜓) ↔ 𝜒)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∀wal 1539 = wceq 1541 ∃wex 1780 ∈ wcel 2110 〈cop 4580 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2112 ax-9 2120 ax-10 2143 ax-11 2159 ax-12 2179 ax-ext 2702 ax-sep 5232 ax-nul 5242 ax-pr 5368 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-rab 3394 df-v 3436 df-dif 3903 df-un 3905 df-ss 3917 df-nul 4282 df-if 4474 df-sn 4575 df-pr 4577 df-op 4581 |
| This theorem is referenced by: brab2d 32578 brab2dd 48838 |
| Copyright terms: Public domain | W3C validator |