ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  xpdom1g GIF version

Theorem xpdom1g 7135
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
StepHypRef Expression
1 reldom 7031 . . . 4 Rel ≼
21brrelex1i 4820 . . 3 (𝐴 ≼ 𝐵 → 𝐴 ∈ V)
3 xpcomeng 7130 . . . 4 ((𝐴 ∈ V ∧ 𝐶 ∈ 𝑉) → (𝐴 × 𝐶) ≈ (𝐶 × 𝐴))
43ancoms 268 . . 3 ((𝐶 ∈ 𝑉 ∧ 𝐴 ∈ V) → (𝐴 × 𝐶) ≈ (𝐶 × 𝐴))
52, 4sylan2 286 . 2 ((𝐶 ∈ 𝑉 ∧ 𝐴 ≼ 𝐵) → (𝐴 × 𝐶) ≈ (𝐶 × 𝐴))
6 xpdom2g 7134 . . 3 ((𝐶 ∈ 𝑉 ∧ 𝐴 ≼ 𝐵) → (𝐶 × 𝐴) ≼ (𝐶 × 𝐵))
71brrelex2i 4821 . . . 4 (𝐴 ≼ 𝐵 → 𝐵 ∈ V)
8 xpcomeng 7130 . . . 4 ((𝐶 ∈ 𝑉 ∧ 𝐵 ∈ V) → (𝐶 × 𝐵) ≈ (𝐵 × 𝐶))
97, 8sylan2 286 . . 3 ((𝐶 ∈ 𝑉 ∧ 𝐴 ≼ 𝐵) → (𝐶 × 𝐵) ≈ (𝐵 × 𝐶))
10 domentr 7082 . . 3 (((𝐶 × 𝐴) ≼ (𝐶 × 𝐵) ∧ (𝐶 × 𝐵) ≈ (𝐵 × 𝐶)) → (𝐶 × 𝐴) ≼ (𝐵 × 𝐶))
116, 9, 10syl2anc 415 . 2 ((𝐶 ∈ 𝑉 ∧ 𝐴 ≼ 𝐵) → (𝐶 × 𝐴) ≼ (𝐵 × 𝐶))
12 endomtr 7081 . 2 (((𝐴 × 𝐶) ≈ (𝐶 × 𝐴) ∧ (𝐶 × 𝐴) ≼ (𝐵 × 𝐶)) → (𝐴 × 𝐶) ≼ (𝐵 × 𝐶))
135, 11, 12syl2anc 415 1 ((𝐶 ∈ 𝑉 ∧ 𝐴 ≼ 𝐵) → (𝐴 × 𝐶) ≼ (𝐵 × 𝐶))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ∈ wcel 2209  Vcvv 2821   class class class wbr 4131   × cxp 4774   ≈ cen 7024   ≼ cdom 7025
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-1st 6378  df-2nd 6379  df-en 7027  df-dom 7028
This theorem is used by:  xpdom1  7137  xpct  13345
  Copyright terms: Public domain W3C validator