Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > eqrelrd2 | Structured version Visualization version GIF version |
Description: A version of eqrelrdv2 5668 with explicit non-free declarations. (Contributed by Thierry Arnoux, 28-Aug-2017.) |
Ref | Expression |
---|---|
eqrelrd2.1 | ⊢ Ⅎ𝑥𝜑 |
eqrelrd2.2 | ⊢ Ⅎ𝑦𝜑 |
eqrelrd2.3 | ⊢ Ⅎ𝑥𝐴 |
eqrelrd2.4 | ⊢ Ⅎ𝑦𝐴 |
eqrelrd2.5 | ⊢ Ⅎ𝑥𝐵 |
eqrelrd2.6 | ⊢ Ⅎ𝑦𝐵 |
eqrelrd2.7 | ⊢ (𝜑 → (〈𝑥, 𝑦〉 ∈ 𝐴 ↔ 〈𝑥, 𝑦〉 ∈ 𝐵)) |
Ref | Expression |
---|---|
eqrelrd2 | ⊢ (((Rel 𝐴 ∧ Rel 𝐵) ∧ 𝜑) → 𝐴 = 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqrelrd2.1 | . . . 4 ⊢ Ⅎ𝑥𝜑 | |
2 | eqrelrd2.2 | . . . . 5 ⊢ Ⅎ𝑦𝜑 | |
3 | eqrelrd2.7 | . . . . 5 ⊢ (𝜑 → (〈𝑥, 𝑦〉 ∈ 𝐴 ↔ 〈𝑥, 𝑦〉 ∈ 𝐵)) | |
4 | 2, 3 | alrimi 2213 | . . . 4 ⊢ (𝜑 → ∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐴 ↔ 〈𝑥, 𝑦〉 ∈ 𝐵)) |
5 | 1, 4 | alrimi 2213 | . . 3 ⊢ (𝜑 → ∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐴 ↔ 〈𝑥, 𝑦〉 ∈ 𝐵)) |
6 | 5 | adantl 484 | . 2 ⊢ (((Rel 𝐴 ∧ Rel 𝐵) ∧ 𝜑) → ∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐴 ↔ 〈𝑥, 𝑦〉 ∈ 𝐵)) |
7 | eqrelrd2.3 | . . . . . 6 ⊢ Ⅎ𝑥𝐴 | |
8 | eqrelrd2.4 | . . . . . 6 ⊢ Ⅎ𝑦𝐴 | |
9 | eqrelrd2.5 | . . . . . 6 ⊢ Ⅎ𝑥𝐵 | |
10 | eqrelrd2.6 | . . . . . 6 ⊢ Ⅎ𝑦𝐵 | |
11 | 1, 2, 7, 8, 9, 10 | ssrelf 30366 | . . . . 5 ⊢ (Rel 𝐴 → (𝐴 ⊆ 𝐵 ↔ ∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐴 → 〈𝑥, 𝑦〉 ∈ 𝐵))) |
12 | 1, 2, 9, 10, 7, 8 | ssrelf 30366 | . . . . 5 ⊢ (Rel 𝐵 → (𝐵 ⊆ 𝐴 ↔ ∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐵 → 〈𝑥, 𝑦〉 ∈ 𝐴))) |
13 | 11, 12 | bi2anan9 637 | . . . 4 ⊢ ((Rel 𝐴 ∧ Rel 𝐵) → ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐴) ↔ (∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐴 → 〈𝑥, 𝑦〉 ∈ 𝐵) ∧ ∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐵 → 〈𝑥, 𝑦〉 ∈ 𝐴)))) |
14 | eqss 3982 | . . . 4 ⊢ (𝐴 = 𝐵 ↔ (𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐴)) | |
15 | 2albiim 1891 | . . . 4 ⊢ (∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐴 ↔ 〈𝑥, 𝑦〉 ∈ 𝐵) ↔ (∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐴 → 〈𝑥, 𝑦〉 ∈ 𝐵) ∧ ∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐵 → 〈𝑥, 𝑦〉 ∈ 𝐴))) | |
16 | 13, 14, 15 | 3bitr4g 316 | . . 3 ⊢ ((Rel 𝐴 ∧ Rel 𝐵) → (𝐴 = 𝐵 ↔ ∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐴 ↔ 〈𝑥, 𝑦〉 ∈ 𝐵))) |
17 | 16 | adantr 483 | . 2 ⊢ (((Rel 𝐴 ∧ Rel 𝐵) ∧ 𝜑) → (𝐴 = 𝐵 ↔ ∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐴 ↔ 〈𝑥, 𝑦〉 ∈ 𝐵))) |
18 | 6, 17 | mpbird 259 | 1 ⊢ (((Rel 𝐴 ∧ Rel 𝐵) ∧ 𝜑) → 𝐴 = 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∀wal 1535 = wceq 1537 Ⅎwnf 1784 ∈ wcel 2114 Ⅎwnfc 2961 ⊆ wss 3936 〈cop 4573 Rel wrel 5560 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pr 5330 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-v 3496 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4568 df-pr 4570 df-op 4574 df-opab 5129 df-xp 5561 df-rel 5562 |
This theorem is referenced by: fpwrelmap 30469 |
Copyright terms: Public domain | W3C validator |