![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > eqbrrdv | Structured version Visualization version GIF version |
Description: Deduction from extensionality principle for relations. (Contributed by Mario Carneiro, 3-Jan-2017.) |
Ref | Expression |
---|---|
eqbrrdv.1 | ⊢ (𝜑 → Rel 𝐴) |
eqbrrdv.2 | ⊢ (𝜑 → Rel 𝐵) |
eqbrrdv.3 | ⊢ (𝜑 → (𝑥𝐴𝑦 ↔ 𝑥𝐵𝑦)) |
Ref | Expression |
---|---|
eqbrrdv | ⊢ (𝜑 → 𝐴 = 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqbrrdv.3 | . . . 4 ⊢ (𝜑 → (𝑥𝐴𝑦 ↔ 𝑥𝐵𝑦)) | |
2 | df-br 5167 | . . . 4 ⊢ (𝑥𝐴𝑦 ↔ 〈𝑥, 𝑦〉 ∈ 𝐴) | |
3 | df-br 5167 | . . . 4 ⊢ (𝑥𝐵𝑦 ↔ 〈𝑥, 𝑦〉 ∈ 𝐵) | |
4 | 1, 2, 3 | 3bitr3g 313 | . . 3 ⊢ (𝜑 → (〈𝑥, 𝑦〉 ∈ 𝐴 ↔ 〈𝑥, 𝑦〉 ∈ 𝐵)) |
5 | 4 | alrimivv 1927 | . 2 ⊢ (𝜑 → ∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐴 ↔ 〈𝑥, 𝑦〉 ∈ 𝐵)) |
6 | eqbrrdv.1 | . . 3 ⊢ (𝜑 → Rel 𝐴) | |
7 | eqbrrdv.2 | . . 3 ⊢ (𝜑 → Rel 𝐵) | |
8 | eqrel 5808 | . . 3 ⊢ ((Rel 𝐴 ∧ Rel 𝐵) → (𝐴 = 𝐵 ↔ ∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐴 ↔ 〈𝑥, 𝑦〉 ∈ 𝐵))) | |
9 | 6, 7, 8 | syl2anc 583 | . 2 ⊢ (𝜑 → (𝐴 = 𝐵 ↔ ∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐴 ↔ 〈𝑥, 𝑦〉 ∈ 𝐵))) |
10 | 5, 9 | mpbird 257 | 1 ⊢ (𝜑 → 𝐴 = 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∀wal 1535 = wceq 1537 ∈ wcel 2108 〈cop 4654 class class class wbr 5166 Rel wrel 5705 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2711 |
This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1540 df-ex 1778 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-v 3490 df-ss 3993 df-br 5167 df-opab 5229 df-xp 5706 df-rel 5707 |
This theorem is referenced by: eqbrrdva 5894 oppcsect2 17840 qusxpid 33356 erimeq2 38634 |
Copyright terms: Public domain | W3C validator |