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 5693 | . . 3 ⊢ (Rel 𝐴 → (𝐴 ⊆ 𝐵 ↔ ∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐴 → 〈𝑥, 𝑦〉 ∈ 𝐵))) | |
2 | ssrel 5693 | . . 3 ⊢ (Rel 𝐵 → (𝐵 ⊆ 𝐴 ↔ ∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐵 → 〈𝑥, 𝑦〉 ∈ 𝐴))) | |
3 | 1, 2 | bi2anan9 636 | . 2 ⊢ ((Rel 𝐴 ∧ Rel 𝐵) → ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐴) ↔ (∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐴 → 〈𝑥, 𝑦〉 ∈ 𝐵) ∧ ∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐵 → 〈𝑥, 𝑦〉 ∈ 𝐴)))) |
4 | eqss 3936 | . 2 ⊢ (𝐴 = 𝐵 ↔ (𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐴)) | |
5 | 2albiim 1893 | . 2 ⊢ (∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐴 ↔ 〈𝑥, 𝑦〉 ∈ 𝐵) ↔ (∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐴 → 〈𝑥, 𝑦〉 ∈ 𝐵) ∧ ∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐵 → 〈𝑥, 𝑦〉 ∈ 𝐴))) | |
6 | 3, 4, 5 | 3bitr4g 314 | 1 ⊢ ((Rel 𝐴 ∧ Rel 𝐵) → (𝐴 = 𝐵 ↔ ∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐴 ↔ 〈𝑥, 𝑦〉 ∈ 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∀wal 1537 = wceq 1539 ∈ wcel 2106 ⊆ wss 3887 〈cop 4567 Rel wrel 5594 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 397 df-tru 1542 df-ex 1783 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-v 3434 df-in 3894 df-ss 3904 df-opab 5137 df-xp 5595 df-rel 5596 |
This theorem is referenced by: eqrelriv 5699 eqrelrdv 5702 eqbrrdv 5703 eqrelrdv2 5705 opabid2 5738 reldm0 5837 iss 5943 asymref 6021 funssres 6478 fsn 7007 eqrelf 36395 iss2 36479 |
Copyright terms: Public domain | W3C validator |