| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > eqrel | Structured version Visualization version GIF version | ||
| Description: Extensionality principle for relations. Theorem 3.2(ii) of [Monk1] p. 33. (Contributed by NM, 2-Aug-1994.) |
| Ref | Expression |
|---|---|
| eqrel | ⊢ ((Rel 𝐴 ∧ Rel 𝐵) → (𝐴 = 𝐵 ↔ ∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐴 ↔ 〈𝑥, 𝑦〉 ∈ 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssrel 5771 | . . 3 ⊢ (Rel 𝐴 → (𝐴 ⊆ 𝐵 ↔ ∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐴 → 〈𝑥, 𝑦〉 ∈ 𝐵))) | |
| 2 | ssrel 5771 | . . 3 ⊢ (Rel 𝐵 → (𝐵 ⊆ 𝐴 ↔ ∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐵 → 〈𝑥, 𝑦〉 ∈ 𝐴))) | |
| 3 | 1, 2 | bi2anan9 649 | . 2 ⊢ ((Rel 𝐴 ∧ Rel 𝐵) → ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐴) ↔ (∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐴 → 〈𝑥, 𝑦〉 ∈ 𝐵) ∧ ∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐵 → 〈𝑥, 𝑦〉 ∈ 𝐴)))) |
| 4 | eqss 3953 | . 2 ⊢ (𝐴 = 𝐵 ↔ (𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐴)) | |
| 5 | 2albiim 1920 | . 2 ⊢ (∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐴 ↔ 〈𝑥, 𝑦〉 ∈ 𝐵) ↔ (∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐴 → 〈𝑥, 𝑦〉 ∈ 𝐵) ∧ ∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐵 → 〈𝑥, 𝑦〉 ∈ 𝐴))) | |
| 6 | 3, 4, 5 | 3bitr4g 317 | 1 ⊢ ((Rel 𝐴 ∧ Rel 𝐵) → (𝐴 = 𝐵 ↔ ∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐴 ↔ 〈𝑥, 𝑦〉 ∈ 𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∀wal 1568 = wceq 1570 ∈ wcel 2143 ⊆ wss 3906 〈cop 4596 Rel wrel 5668 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-tru 1573 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-v 3457 df-ss 3923 df-opab 5175 df-xp 5669 df-rel 5670 |
| This theorem is referenced by: eqrelriv 5777 eqrelrdv 5780 eqbrrdv 5781 eqrelrdv2 5783 opabid2 5817 reldm0 5920 iss 6039 asymref 6118 funssres 6582 fsn 7133 eqrelf 38885 iss2 38971 |
| Copyright terms: Public domain | W3C validator |