| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > eqrelrdv | Structured version Visualization version GIF version | ||
| Description: Deduce equality of relations from equivalence of membership. (Contributed by Rodolfo Medina, 10-Oct-2010.) |
| Ref | Expression |
|---|---|
| eqrelrdv.1 | ⊢ Rel 𝐴 |
| eqrelrdv.2 | ⊢ Rel 𝐵 |
| eqrelrdv.3 | ⊢ (𝜑 → (〈𝑥, 𝑦〉 ∈ 𝐴 ↔ 〈𝑥, 𝑦〉 ∈ 𝐵)) |
| Ref | Expression |
|---|---|
| eqrelrdv | ⊢ (𝜑 → 𝐴 = 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqrelrdv.3 | . . 3 ⊢ (𝜑 → (〈𝑥, 𝑦〉 ∈ 𝐴 ↔ 〈𝑥, 𝑦〉 ∈ 𝐵)) | |
| 2 | 1 | alrimivv 1961 | . 2 ⊢ (𝜑 → ∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐴 ↔ 〈𝑥, 𝑦〉 ∈ 𝐵)) |
| 3 | eqrelrdv.1 | . . 3 ⊢ Rel 𝐴 | |
| 4 | eqrelrdv.2 | . . 3 ⊢ Rel 𝐵 | |
| 5 | eqrel 5772 | . . 3 ⊢ ((Rel 𝐴 ∧ Rel 𝐵) → (𝐴 = 𝐵 ↔ ∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐴 ↔ 〈𝑥, 𝑦〉 ∈ 𝐵))) | |
| 6 | 3, 4, 5 | mp2an 705 | . 2 ⊢ (𝐴 = 𝐵 ↔ ∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐴 ↔ 〈𝑥, 𝑦〉 ∈ 𝐵)) |
| 7 | 2, 6 | sylibr 237 | 1 ⊢ (𝜑 → 𝐴 = 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∀wal 1568 = wceq 1570 ∈ wcel 2146 〈cop 4597 Rel wrel 5668 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-v 3459 df-ss 3923 df-opab 5176 df-xp 5669 df-rel 5670 |
| This theorem is used by: eqbrrdiv 5782 fcnvres 6759 fmptco 7129 fpwwe2lem7 10639 fpwwe2lem11 10643 fsumcom2 15850 fprodcom2 16063 gsumcom2 20091 lgsquadlem1 27597 lgsquadlem2 27598 fmptcof2 33075 dfcnv2 33093 dih1dimatlem 42163 |
| Copyright terms: Public domain | W3C validator |