Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > eqbrrdva | Structured version Visualization version GIF version |
Description: Deduction from extensionality principle for relations, given an equivalence only on the relation domain and range. (Contributed by Thierry Arnoux, 28-Nov-2017.) |
Ref | Expression |
---|---|
eqbrrdva.1 | ⊢ (𝜑 → 𝐴 ⊆ (𝐶 × 𝐷)) |
eqbrrdva.2 | ⊢ (𝜑 → 𝐵 ⊆ (𝐶 × 𝐷)) |
eqbrrdva.3 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷) → (𝑥𝐴𝑦 ↔ 𝑥𝐵𝑦)) |
Ref | Expression |
---|---|
eqbrrdva | ⊢ (𝜑 → 𝐴 = 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqbrrdva.1 | . . . 4 ⊢ (𝜑 → 𝐴 ⊆ (𝐶 × 𝐷)) | |
2 | xpss 5571 | . . . 4 ⊢ (𝐶 × 𝐷) ⊆ (V × V) | |
3 | 1, 2 | sstrdi 3979 | . . 3 ⊢ (𝜑 → 𝐴 ⊆ (V × V)) |
4 | df-rel 5562 | . . 3 ⊢ (Rel 𝐴 ↔ 𝐴 ⊆ (V × V)) | |
5 | 3, 4 | sylibr 236 | . 2 ⊢ (𝜑 → Rel 𝐴) |
6 | eqbrrdva.2 | . . . 4 ⊢ (𝜑 → 𝐵 ⊆ (𝐶 × 𝐷)) | |
7 | 6, 2 | sstrdi 3979 | . . 3 ⊢ (𝜑 → 𝐵 ⊆ (V × V)) |
8 | df-rel 5562 | . . 3 ⊢ (Rel 𝐵 ↔ 𝐵 ⊆ (V × V)) | |
9 | 7, 8 | sylibr 236 | . 2 ⊢ (𝜑 → Rel 𝐵) |
10 | 1 | ssbrd 5109 | . . . 4 ⊢ (𝜑 → (𝑥𝐴𝑦 → 𝑥(𝐶 × 𝐷)𝑦)) |
11 | brxp 5601 | . . . 4 ⊢ (𝑥(𝐶 × 𝐷)𝑦 ↔ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷)) | |
12 | 10, 11 | syl6ib 253 | . . 3 ⊢ (𝜑 → (𝑥𝐴𝑦 → (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷))) |
13 | 6 | ssbrd 5109 | . . . 4 ⊢ (𝜑 → (𝑥𝐵𝑦 → 𝑥(𝐶 × 𝐷)𝑦)) |
14 | 13, 11 | syl6ib 253 | . . 3 ⊢ (𝜑 → (𝑥𝐵𝑦 → (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷))) |
15 | eqbrrdva.3 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷) → (𝑥𝐴𝑦 ↔ 𝑥𝐵𝑦)) | |
16 | 15 | 3expib 1118 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷) → (𝑥𝐴𝑦 ↔ 𝑥𝐵𝑦))) |
17 | 12, 14, 16 | pm5.21ndd 383 | . 2 ⊢ (𝜑 → (𝑥𝐴𝑦 ↔ 𝑥𝐵𝑦)) |
18 | 5, 9, 17 | eqbrrdv 5666 | 1 ⊢ (𝜑 → 𝐴 = 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 Vcvv 3494 ⊆ wss 3936 class class class wbr 5066 × cxp 5553 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-rex 3144 df-rab 3147 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-br 5067 df-opab 5129 df-xp 5561 df-rel 5562 |
This theorem is referenced by: metustsym 23165 |
Copyright terms: Public domain | W3C validator |