| 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 8958 | . . . 4 ⊢ Rel ≼ | |
| 2 | 1 | brrelex1i 5711 | . . 3 ⊢ (𝐴 ≼ 𝐵 → 𝐴 ∈ V) |
| 3 | xpcomeng 9067 | . . . 4 ⊢ ((𝐴 ∈ V ∧ 𝐶 ∈ 𝑉) → (𝐴 × 𝐶) ≈ (𝐶 × 𝐴)) | |
| 4 | 3 | ancoms 464 | . . 3 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐴 ∈ V) → (𝐴 × 𝐶) ≈ (𝐶 × 𝐴)) |
| 5 | 2, 4 | sylan2 605 | . 2 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐴 ≼ 𝐵) → (𝐴 × 𝐶) ≈ (𝐶 × 𝐴)) |
| 6 | xpdom2g 9071 | . . 3 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐴 ≼ 𝐵) → (𝐶 × 𝐴) ≼ (𝐶 × 𝐵)) | |
| 7 | 1 | brrelex2i 5712 | . . . 4 ⊢ (𝐴 ≼ 𝐵 → 𝐵 ∈ V) |
| 8 | xpcomeng 9067 | . . . 4 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐵 ∈ V) → (𝐶 × 𝐵) ≈ (𝐵 × 𝐶)) | |
| 9 | 7, 8 | sylan2 605 | . . 3 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐴 ≼ 𝐵) → (𝐶 × 𝐵) ≈ (𝐵 × 𝐶)) |
| 10 | domentr 9019 | . . 3 ⊢ (((𝐶 × 𝐴) ≼ (𝐶 × 𝐵) ∧ (𝐶 × 𝐵) ≈ (𝐵 × 𝐶)) → (𝐶 × 𝐴) ≼ (𝐵 × 𝐶)) | |
| 11 | 6, 9, 10 | syl2anc 596 | . 2 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐴 ≼ 𝐵) → (𝐶 × 𝐴) ≼ (𝐵 × 𝐶)) |
| 12 | endomtr 9018 | . 2 ⊢ (((𝐴 × 𝐶) ≈ (𝐶 × 𝐴) ∧ (𝐶 × 𝐴) ≼ (𝐵 × 𝐶)) → (𝐴 × 𝐶) ≼ (𝐵 × 𝐶)) | |
| 13 | 5, 11, 12 | syl2anc 596 | 1 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐴 ≼ 𝐵) → (𝐴 × 𝐶) ≼ (𝐵 × 𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∈ wcel 2145 Vcvv 3450 class class class wbr 5103 × cxp 5653 ≈ cen 8949 ≼ cdom 8950 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-1st 7986 df-2nd 7987 df-en 8953 df-dom 8954 |
| This theorem is used by: xpdom1 9074 xpen 9138 xpct 10019 infpwfien 10065 infdjuabs 10207 fin56 10395 fnct 10544 fnctOLD 10545 iunctb 10583 canthp1lem1 10661 pwdjundom 10676 gchxpidm 10678 |
| Copyright terms: Public domain | W3C validator |