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 5520 | . . 3 ⊢ (𝐴 = 𝐵 → (𝑅 Fr 𝐴 ↔ 𝑅 Fr 𝐵)) | |
2 | soeq2 5489 | . . 3 ⊢ (𝐴 = 𝐵 → (𝑅 Or 𝐴 ↔ 𝑅 Or 𝐵)) | |
3 | 1, 2 | anbi12d 632 | . 2 ⊢ (𝐴 = 𝐵 → ((𝑅 Fr 𝐴 ∧ 𝑅 Or 𝐴) ↔ (𝑅 Fr 𝐵 ∧ 𝑅 Or 𝐵))) |
4 | df-we 5510 | . 2 ⊢ (𝑅 We 𝐴 ↔ (𝑅 Fr 𝐴 ∧ 𝑅 Or 𝐴)) | |
5 | df-we 5510 | . 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 1533 Or wor 5467 Fr wfr 5505 We wwe 5507 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-clab 2800 df-cleq 2814 df-clel 2893 df-ral 3143 df-in 3942 df-ss 3951 df-po 5468 df-so 5469 df-fr 5508 df-we 5510 |
This theorem is referenced by: ordeq 6192 0we1 8125 oieq2 8971 hartogslem1 9000 wemapwe 9154 ween 9455 dfac8 9555 weth 9911 fpwwe2cbv 10046 fpwwe2lem2 10048 fpwwe2lem5 10050 fpwwecbv 10060 fpwwelem 10061 canthwelem 10066 canthwe 10067 pwfseqlem4a 10077 pwfseqlem4 10078 ltweuz 13323 ltwenn 13324 bpolylem 15396 ltbwe 20247 vitali 24208 weeq12d 39633 aomclem6 39652 omeiunle 42793 |
Copyright terms: Public domain | W3C validator |