Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > xpdom1g | Structured version Visualization version GIF version |
Description: Dominance law for Cartesian product. Theorem 6L(c) of [Enderton] p. 149. (Contributed by NM, 25-Mar-2006.) (Revised by Mario Carneiro, 26-Apr-2015.) |
Ref | Expression |
---|---|
xpdom1g | ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐴 ≼ 𝐵) → (𝐴 × 𝐶) ≼ (𝐵 × 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | reldom 8515 | . . . 4 ⊢ Rel ≼ | |
2 | 1 | brrelex1i 5608 | . . 3 ⊢ (𝐴 ≼ 𝐵 → 𝐴 ∈ V) |
3 | xpcomeng 8609 | . . . 4 ⊢ ((𝐴 ∈ V ∧ 𝐶 ∈ 𝑉) → (𝐴 × 𝐶) ≈ (𝐶 × 𝐴)) | |
4 | 3 | ancoms 461 | . . 3 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐴 ∈ V) → (𝐴 × 𝐶) ≈ (𝐶 × 𝐴)) |
5 | 2, 4 | sylan2 594 | . 2 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐴 ≼ 𝐵) → (𝐴 × 𝐶) ≈ (𝐶 × 𝐴)) |
6 | xpdom2g 8613 | . . 3 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐴 ≼ 𝐵) → (𝐶 × 𝐴) ≼ (𝐶 × 𝐵)) | |
7 | 1 | brrelex2i 5609 | . . . 4 ⊢ (𝐴 ≼ 𝐵 → 𝐵 ∈ V) |
8 | xpcomeng 8609 | . . . 4 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐵 ∈ V) → (𝐶 × 𝐵) ≈ (𝐵 × 𝐶)) | |
9 | 7, 8 | sylan2 594 | . . 3 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐴 ≼ 𝐵) → (𝐶 × 𝐵) ≈ (𝐵 × 𝐶)) |
10 | domentr 8568 | . . 3 ⊢ (((𝐶 × 𝐴) ≼ (𝐶 × 𝐵) ∧ (𝐶 × 𝐵) ≈ (𝐵 × 𝐶)) → (𝐶 × 𝐴) ≼ (𝐵 × 𝐶)) | |
11 | 6, 9, 10 | syl2anc 586 | . 2 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐴 ≼ 𝐵) → (𝐶 × 𝐴) ≼ (𝐵 × 𝐶)) |
12 | endomtr 8567 | . 2 ⊢ (((𝐴 × 𝐶) ≈ (𝐶 × 𝐴) ∧ (𝐶 × 𝐴) ≼ (𝐵 × 𝐶)) → (𝐴 × 𝐶) ≼ (𝐵 × 𝐶)) | |
13 | 5, 11, 12 | syl2anc 586 | 1 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐴 ≼ 𝐵) → (𝐴 × 𝐶) ≼ (𝐵 × 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∈ wcel 2114 Vcvv 3494 class class class wbr 5066 × cxp 5553 ≈ cen 8506 ≼ cdom 8507 |
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 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-br 5067 df-opab 5129 df-mpt 5147 df-id 5460 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-1st 7689 df-2nd 7690 df-en 8510 df-dom 8511 |
This theorem is referenced by: xpdom1 8616 xpen 8680 xpct 9442 infpwfien 9488 infdjuabs 9628 fin56 9815 fnct 9959 iunctb 9996 canthp1lem1 10074 pwdjundom 10089 gchxpidm 10091 |
Copyright terms: Public domain | W3C validator |