Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > weeq2 | Structured version Visualization version GIF version |
Description: Equality theorem for the well-ordering predicate. (Contributed by NM, 3-Apr-1994.) |
Ref | Expression |
---|---|
weeq2 | ⊢ (𝐴 = 𝐵 → (𝑅 We 𝐴 ↔ 𝑅 We 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | freq2 5528 | . . 3 ⊢ (𝐴 = 𝐵 → (𝑅 Fr 𝐴 ↔ 𝑅 Fr 𝐵)) | |
2 | soeq2 5497 | . . 3 ⊢ (𝐴 = 𝐵 → (𝑅 Or 𝐴 ↔ 𝑅 Or 𝐵)) | |
3 | 1, 2 | anbi12d 632 | . 2 ⊢ (𝐴 = 𝐵 → ((𝑅 Fr 𝐴 ∧ 𝑅 Or 𝐴) ↔ (𝑅 Fr 𝐵 ∧ 𝑅 Or 𝐵))) |
4 | df-we 5518 | . 2 ⊢ (𝑅 We 𝐴 ↔ (𝑅 Fr 𝐴 ∧ 𝑅 Or 𝐴)) | |
5 | df-we 5518 | . 2 ⊢ (𝑅 We 𝐵 ↔ (𝑅 Fr 𝐵 ∧ 𝑅 Or 𝐵)) | |
6 | 3, 4, 5 | 3bitr4g 316 | 1 ⊢ (𝐴 = 𝐵 → (𝑅 We 𝐴 ↔ 𝑅 We 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1537 Or wor 5475 Fr wfr 5513 We wwe 5515 |
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 df-so 5477 df-fr 5516 df-we 5518 |
This theorem is referenced by: ordeq 6200 0we1 8133 oieq2 8979 hartogslem1 9008 wemapwe 9162 ween 9463 dfac8 9563 weth 9919 fpwwe2cbv 10054 fpwwe2lem2 10056 fpwwe2lem5 10058 fpwwecbv 10068 fpwwelem 10069 canthwelem 10074 canthwe 10075 pwfseqlem4a 10085 pwfseqlem4 10086 ltweuz 13332 ltwenn 13333 bpolylem 15404 ltbwe 20255 vitali 24216 weeq12d 39647 aomclem6 39666 omeiunle 42806 |
Copyright terms: Public domain | W3C validator |