xpdom1g - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > xpdom1g		Structured version Visualization version GIF version

Theorem xpdom1g 9093

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.)

**Assertion**
Ref	Expression
xpdom1g	⊢ ((𝐶 ∈ 𝑉 ∧ 𝐴 ≼ 𝐵) → (𝐴 × 𝐶) ≼ (𝐵 × 𝐶))

**Proof of Theorem xpdom1g**
Step	Hyp	Ref	Expression
1		reldom 8969	. . . 4 ⊢ Rel ≼
2	1	brrelex1i 5734	. . 3 ⊢ (𝐴 ≼ 𝐵 → 𝐴 ∈ V)
3		xpcomeng 9088	. . . 4 ⊢ ((𝐴 ∈ V ∧ 𝐶 ∈ 𝑉) → (𝐴 × 𝐶) ≈ (𝐶 × 𝐴))
4	3	ancoms 457	. . 3 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐴 ∈ V) → (𝐴 × 𝐶) ≈ (𝐶 × 𝐴))
5	2, 4	sylan2 591	. 2 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐴 ≼ 𝐵) → (𝐴 × 𝐶) ≈ (𝐶 × 𝐴))
6		xpdom2g 9092	. . 3 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐴 ≼ 𝐵) → (𝐶 × 𝐴) ≼ (𝐶 × 𝐵))
7	1	brrelex2i 5735	. . . 4 ⊢ (𝐴 ≼ 𝐵 → 𝐵 ∈ V)
8		xpcomeng 9088	. . . 4 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐵 ∈ V) → (𝐶 × 𝐵) ≈ (𝐵 × 𝐶))
9	7, 8	sylan2 591	. . 3 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐴 ≼ 𝐵) → (𝐶 × 𝐵) ≈ (𝐵 × 𝐶))
10		domentr 9033	. . 3 ⊢ (((𝐶 × 𝐴) ≼ (𝐶 × 𝐵) ∧ (𝐶 × 𝐵) ≈ (𝐵 × 𝐶)) → (𝐶 × 𝐴) ≼ (𝐵 × 𝐶))
11	6, 9, 10	syl2anc 582	. 2 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐴 ≼ 𝐵) → (𝐶 × 𝐴) ≼ (𝐵 × 𝐶))
12		endomtr 9032	. 2 ⊢ (((𝐴 × 𝐶) ≈ (𝐶 × 𝐴) ∧ (𝐶 × 𝐴) ≼ (𝐵 × 𝐶)) → (𝐴 × 𝐶) ≼ (𝐵 × 𝐶))
13	5, 11, 12	syl2anc 582	1 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐴 ≼ 𝐵) → (𝐴 × 𝐶) ≼ (𝐵 × 𝐶))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 394 ∈ wcel 2098 Vcvv 3461 class class class wbr 5149 × cxp 5676 ≈ cen 8960 ≼ cdom 8961

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-sep 5300 ax-nul 5307 ax-pow 5365 ax-pr 5429 ax-un 7740

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2930 df-ral 3051 df-rex 3060 df-rab 3419 df-v 3463 df-sbc 3774 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-nul 4323 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4910 df-br 5150 df-opab 5212 df-mpt 5233 df-id 5576 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-rn 5689 df-res 5690 df-ima 5691 df-iota 6500 df-fun 6550 df-fn 6551 df-f 6552 df-f1 6553 df-fo 6554 df-f1o 6555 df-fv 6556 df-1st 7993 df-2nd 7994 df-en 8964 df-dom 8965

This theorem is referenced by: xpdom1 9095 xpen 9164 xpct 10040 infpwfien 10086 infdjuabs 10230 fin56 10417 fnct 10561 iunctb 10598 canthp1lem1 10676 pwdjundom 10691 gchxpidm 10693

W3C validator

	
		OSZAR »