Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > eqbrrdv | 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 3983 | . . . 4 ⊢ (𝑥𝐴𝑦 ↔ 〈𝑥, 𝑦〉 ∈ 𝐴) | |
3 | df-br 3983 | . . . 4 ⊢ (𝑥𝐵𝑦 ↔ 〈𝑥, 𝑦〉 ∈ 𝐵) | |
4 | 1, 2, 3 | 3bitr3g 221 | . . 3 ⊢ (𝜑 → (〈𝑥, 𝑦〉 ∈ 𝐴 ↔ 〈𝑥, 𝑦〉 ∈ 𝐵)) |
5 | 4 | alrimivv 1863 | . 2 ⊢ (𝜑 → ∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐴 ↔ 〈𝑥, 𝑦〉 ∈ 𝐵)) |
6 | eqbrrdv.1 | . . 3 ⊢ (𝜑 → Rel 𝐴) | |
7 | eqbrrdv.2 | . . 3 ⊢ (𝜑 → Rel 𝐵) | |
8 | eqrel 4693 | . . 3 ⊢ ((Rel 𝐴 ∧ Rel 𝐵) → (𝐴 = 𝐵 ↔ ∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐴 ↔ 〈𝑥, 𝑦〉 ∈ 𝐵))) | |
9 | 6, 7, 8 | syl2anc 409 | . 2 ⊢ (𝜑 → (𝐴 = 𝐵 ↔ ∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ 𝐴 ↔ 〈𝑥, 𝑦〉 ∈ 𝐵))) |
10 | 5, 9 | mpbird 166 | 1 ⊢ (𝜑 → 𝐴 = 𝐵) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 104 ∀wal 1341 = wceq 1343 ∈ wcel 2136 〈cop 3579 class class class wbr 3982 Rel wrel 4609 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-14 2139 ax-ext 2147 ax-sep 4100 ax-pow 4153 ax-pr 4187 |
This theorem depends on definitions: df-bi 116 df-3an 970 df-tru 1346 df-nf 1449 df-sb 1751 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-v 2728 df-un 3120 df-in 3122 df-ss 3129 df-pw 3561 df-sn 3582 df-pr 3583 df-op 3585 df-br 3983 df-opab 4044 df-xp 4610 df-rel 4611 |
This theorem is referenced by: eqbrrdva 4774 |
Copyright terms: Public domain | W3C validator |