![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > poeq2 | Structured version Visualization version GIF version |
Description: Equality theorem for partial ordering predicate. (Contributed by NM, 27-Mar-1997.) |
Ref | Expression |
---|---|
poeq2 | ⊢ (𝐴 = 𝐵 → (𝑅 Po 𝐴 ↔ 𝑅 Po 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqimss2 3972 | . . 3 ⊢ (𝐴 = 𝐵 → 𝐵 ⊆ 𝐴) | |
2 | poss 5440 | . . 3 ⊢ (𝐵 ⊆ 𝐴 → (𝑅 Po 𝐴 → 𝑅 Po 𝐵)) | |
3 | 1, 2 | syl 17 | . 2 ⊢ (𝐴 = 𝐵 → (𝑅 Po 𝐴 → 𝑅 Po 𝐵)) |
4 | eqimss 3971 | . . 3 ⊢ (𝐴 = 𝐵 → 𝐴 ⊆ 𝐵) | |
5 | poss 5440 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → (𝑅 Po 𝐵 → 𝑅 Po 𝐴)) | |
6 | 4, 5 | syl 17 | . 2 ⊢ (𝐴 = 𝐵 → (𝑅 Po 𝐵 → 𝑅 Po 𝐴)) |
7 | 3, 6 | impbid 215 | 1 ⊢ (𝐴 = 𝐵 → (𝑅 Po 𝐴 ↔ 𝑅 Po 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 = wceq 1538 ⊆ wss 3881 Po wpo 5436 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-ex 1782 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-ral 3111 df-v 3443 df-in 3888 df-ss 3898 df-po 5438 |
This theorem is referenced by: posn 5601 frfi 8747 dfpo2 33104 ipo0 41153 |
Copyright terms: Public domain | W3C validator |