| 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 418 | . . 3 ⊢ (𝜑 → ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝜓 ↔ 𝜒))) |
| 3 | 2 | alrimivv 1965 | . 2 ⊢ (𝜑 → ∀𝑥∀𝑦((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝜓 ↔ 𝜒))) |
| 4 | copsex2dv.a | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝑈) | |
| 5 | copsex2dv.b | . 2 ⊢ (𝜑 → 𝐵 ∈ 𝑉) | |
| 6 | copsex2t 5470 | . 2 ⊢ ((∀𝑥∀𝑦((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝜓 ↔ 𝜒)) ∧ (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉)) → (∃𝑥∃𝑦(〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉 ∧ 𝜓) ↔ 𝜒)) | |
| 7 | 3, 4, 5, 6 | syl12anc 850 | 1 ⊢ (𝜑 → (∃𝑥∃𝑦(〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉 ∧ 𝜓) ↔ 𝜒)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∀wal 1570 = wceq 1572 ∃wex 1814 ∈ wcel 2150 〈cop 4839 |
| 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-clab 2745 df-cleq 2758 df-clel 2842 df-rab 3416 df-v 3455 df-ss 3900 df-dif 4049 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4840 |
| This theorem is used by: brab2d 5518 brab2dd 50360 |
| Copyright terms: Public domain | W3C validator |