Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > wexp | Structured version Visualization version GIF version |
Description: A lexicographical ordering of two well-ordered classes. (Contributed by Scott Fenton, 17-Mar-2011.) (Revised by Mario Carneiro, 7-Mar-2013.) |
Ref | Expression |
---|---|
wexp.1 | ⊢ 𝑇 = {〈𝑥, 𝑦〉 ∣ ((𝑥 ∈ (𝐴 × 𝐵) ∧ 𝑦 ∈ (𝐴 × 𝐵)) ∧ ((1st ‘𝑥)𝑅(1st ‘𝑦) ∨ ((1st ‘𝑥) = (1st ‘𝑦) ∧ (2nd ‘𝑥)𝑆(2nd ‘𝑦))))} |
Ref | Expression |
---|---|
wexp | ⊢ ((𝑅 We 𝐴 ∧ 𝑆 We 𝐵) → 𝑇 We (𝐴 × 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | wefr 5028 | . . 3 ⊢ (𝑅 We 𝐴 → 𝑅 Fr 𝐴) | |
2 | wefr 5028 | . . 3 ⊢ (𝑆 We 𝐵 → 𝑆 Fr 𝐵) | |
3 | wexp.1 | . . . 4 ⊢ 𝑇 = {〈𝑥, 𝑦〉 ∣ ((𝑥 ∈ (𝐴 × 𝐵) ∧ 𝑦 ∈ (𝐴 × 𝐵)) ∧ ((1st ‘𝑥)𝑅(1st ‘𝑦) ∨ ((1st ‘𝑥) = (1st ‘𝑦) ∧ (2nd ‘𝑥)𝑆(2nd ‘𝑦))))} | |
4 | 3 | frxp 7174 | . . 3 ⊢ ((𝑅 Fr 𝐴 ∧ 𝑆 Fr 𝐵) → 𝑇 Fr (𝐴 × 𝐵)) |
5 | 1, 2, 4 | syl2an 493 | . 2 ⊢ ((𝑅 We 𝐴 ∧ 𝑆 We 𝐵) → 𝑇 Fr (𝐴 × 𝐵)) |
6 | weso 5029 | . . 3 ⊢ (𝑅 We 𝐴 → 𝑅 Or 𝐴) | |
7 | weso 5029 | . . 3 ⊢ (𝑆 We 𝐵 → 𝑆 Or 𝐵) | |
8 | 3 | soxp 7177 | . . 3 ⊢ ((𝑅 Or 𝐴 ∧ 𝑆 Or 𝐵) → 𝑇 Or (𝐴 × 𝐵)) |
9 | 6, 7, 8 | syl2an 493 | . 2 ⊢ ((𝑅 We 𝐴 ∧ 𝑆 We 𝐵) → 𝑇 Or (𝐴 × 𝐵)) |
10 | df-we 4999 | . 2 ⊢ (𝑇 We (𝐴 × 𝐵) ↔ (𝑇 Fr (𝐴 × 𝐵) ∧ 𝑇 Or (𝐴 × 𝐵))) | |
11 | 5, 9, 10 | sylanbrc 695 | 1 ⊢ ((𝑅 We 𝐴 ∧ 𝑆 We 𝐵) → 𝑇 We (𝐴 × 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∨ wo 382 ∧ wa 383 = wceq 1475 ∈ wcel 1977 class class class wbr 4583 {copab 4642 Or wor 4958 Fr wfr 4994 We wwe 4996 × cxp 5036 ‘cfv 5804 1st c1st 7057 2nd c2nd 7058 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-int 4411 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fv 5812 df-1st 7059 df-2nd 7060 |
This theorem is referenced by: fnwelem 7179 leweon 8717 |
Copyright terms: Public domain | W3C validator |