![]() |
Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > opideq | Structured version Visualization version GIF version |
Description: Equality conditions for ordered pairs 〈𝐴, 𝐴〉 and 〈𝐵, 𝐵〉. (Contributed by Peter Mazsa, 22-Jul-2019.) (Revised by Thierry Arnoux, 16-Feb-2022.) |
Ref | Expression |
---|---|
opideq | ⊢ (𝐴 ∈ 𝑉 → (〈𝐴, 𝐴〉 = 〈𝐵, 𝐵〉 ↔ 𝐴 = 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | opthg 5470 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) → (〈𝐴, 𝐴〉 = 〈𝐵, 𝐵〉 ↔ (𝐴 = 𝐵 ∧ 𝐴 = 𝐵))) | |
2 | 1 | anidms 567 | . 2 ⊢ (𝐴 ∈ 𝑉 → (〈𝐴, 𝐴〉 = 〈𝐵, 𝐵〉 ↔ (𝐴 = 𝐵 ∧ 𝐴 = 𝐵))) |
3 | anidm 565 | . 2 ⊢ ((𝐴 = 𝐵 ∧ 𝐴 = 𝐵) ↔ 𝐴 = 𝐵) | |
4 | 2, 3 | bitrdi 286 | 1 ⊢ (𝐴 ∈ 𝑉 → (〈𝐴, 𝐴〉 = 〈𝐵, 𝐵〉 ↔ 𝐴 = 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 〈cop 4628 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2702 ax-sep 5292 ax-nul 5299 ax-pr 5420 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-sb 2068 df-clab 2709 df-cleq 2723 df-clel 2809 df-rab 3432 df-v 3475 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-nul 4319 df-if 4523 df-sn 4623 df-pr 4625 df-op 4629 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |