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 4026 | . . 3 ⊢ (𝐴 = 𝐵 → 𝐵 ⊆ 𝐴) | |
2 | poss 5478 | . . 3 ⊢ (𝐵 ⊆ 𝐴 → (𝑅 Po 𝐴 → 𝑅 Po 𝐵)) | |
3 | 1, 2 | syl 17 | . 2 ⊢ (𝐴 = 𝐵 → (𝑅 Po 𝐴 → 𝑅 Po 𝐵)) |
4 | eqimss 4025 | . . 3 ⊢ (𝐴 = 𝐵 → 𝐴 ⊆ 𝐵) | |
5 | poss 5478 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → (𝑅 Po 𝐵 → 𝑅 Po 𝐴)) | |
6 | 4, 5 | syl 17 | . 2 ⊢ (𝐴 = 𝐵 → (𝑅 Po 𝐵 → 𝑅 Po 𝐴)) |
7 | 3, 6 | impbid 214 | 1 ⊢ (𝐴 = 𝐵 → (𝑅 Po 𝐴 ↔ 𝑅 Po 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 = wceq 1537 ⊆ wss 3938 Po wpo 5474 |
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 2795 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2802 df-cleq 2816 df-clel 2895 df-ral 3145 df-in 3945 df-ss 3954 df-po 5476 |
This theorem is referenced by: posn 5639 frfi 8765 dfpo2 32993 ipo0 40788 |
Copyright terms: Public domain | W3C validator |