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

Theorem xpwdomg 8373
Description: Weak dominance of a Cartesian product. (Contributed by Stefan O'Rear, 13-Feb-2015.) (Revised by Mario Carneiro, 25-Jun-2015.)
Assertion
Ref Expression
xpwdomg ((𝐴* 𝐵𝐶* 𝐷) → (𝐴 × 𝐶) ≼* (𝐵 × 𝐷))

Proof of Theorem xpwdomg
Dummy variables 𝑎 𝑏 𝑐 𝑓 𝑔 𝑥 𝑦 𝑑 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 brwdom3i 8371 . . 3 (𝐴* 𝐵 → ∃𝑓𝑎𝐴𝑏𝐵 𝑎 = (𝑓𝑏))
21adantr 480 . 2 ((𝐴* 𝐵𝐶* 𝐷) → ∃𝑓𝑎𝐴𝑏𝐵 𝑎 = (𝑓𝑏))
3 brwdom3i 8371 . . 3 (𝐶* 𝐷 → ∃𝑔𝑐𝐶𝑑𝐷 𝑐 = (𝑔𝑑))
43adantl 481 . 2 ((𝐴* 𝐵𝐶* 𝐷) → ∃𝑔𝑐𝐶𝑑𝐷 𝑐 = (𝑔𝑑))
5 relwdom 8354 . . . . . . . . . 10 Rel ≼*
65brrelexi 5082 . . . . . . . . 9 (𝐴* 𝐵𝐴 ∈ V)
75brrelexi 5082 . . . . . . . . 9 (𝐶* 𝐷𝐶 ∈ V)
8 xpexg 6858 . . . . . . . . 9 ((𝐴 ∈ V ∧ 𝐶 ∈ V) → (𝐴 × 𝐶) ∈ V)
96, 7, 8syl2an 493 . . . . . . . 8 ((𝐴* 𝐵𝐶* 𝐷) → (𝐴 × 𝐶) ∈ V)
109adantr 480 . . . . . . 7 (((𝐴* 𝐵𝐶* 𝐷) ∧ (∀𝑎𝐴𝑏𝐵 𝑎 = (𝑓𝑏) ∧ ∀𝑐𝐶𝑑𝐷 𝑐 = (𝑔𝑑))) → (𝐴 × 𝐶) ∈ V)
115brrelex2i 5083 . . . . . . . . 9 (𝐴* 𝐵𝐵 ∈ V)
125brrelex2i 5083 . . . . . . . . 9 (𝐶* 𝐷𝐷 ∈ V)
13 xpexg 6858 . . . . . . . . 9 ((𝐵 ∈ V ∧ 𝐷 ∈ V) → (𝐵 × 𝐷) ∈ V)
1411, 12, 13syl2an 493 . . . . . . . 8 ((𝐴* 𝐵𝐶* 𝐷) → (𝐵 × 𝐷) ∈ V)
1514adantr 480 . . . . . . 7 (((𝐴* 𝐵𝐶* 𝐷) ∧ (∀𝑎𝐴𝑏𝐵 𝑎 = (𝑓𝑏) ∧ ∀𝑐𝐶𝑑𝐷 𝑐 = (𝑔𝑑))) → (𝐵 × 𝐷) ∈ V)
16 pm3.2 462 . . . . . . . . . . . . . . . 16 (∃𝑏𝐵 𝑎 = (𝑓𝑏) → (∃𝑑𝐷 𝑐 = (𝑔𝑑) → (∃𝑏𝐵 𝑎 = (𝑓𝑏) ∧ ∃𝑑𝐷 𝑐 = (𝑔𝑑))))
1716ralimdv 2946 . . . . . . . . . . . . . . 15 (∃𝑏𝐵 𝑎 = (𝑓𝑏) → (∀𝑐𝐶𝑑𝐷 𝑐 = (𝑔𝑑) → ∀𝑐𝐶 (∃𝑏𝐵 𝑎 = (𝑓𝑏) ∧ ∃𝑑𝐷 𝑐 = (𝑔𝑑))))
1817com12 32 . . . . . . . . . . . . . 14 (∀𝑐𝐶𝑑𝐷 𝑐 = (𝑔𝑑) → (∃𝑏𝐵 𝑎 = (𝑓𝑏) → ∀𝑐𝐶 (∃𝑏𝐵 𝑎 = (𝑓𝑏) ∧ ∃𝑑𝐷 𝑐 = (𝑔𝑑))))
1918ralimdv 2946 . . . . . . . . . . . . 13 (∀𝑐𝐶𝑑𝐷 𝑐 = (𝑔𝑑) → (∀𝑎𝐴𝑏𝐵 𝑎 = (𝑓𝑏) → ∀𝑎𝐴𝑐𝐶 (∃𝑏𝐵 𝑎 = (𝑓𝑏) ∧ ∃𝑑𝐷 𝑐 = (𝑔𝑑))))
2019impcom 445 . . . . . . . . . . . 12 ((∀𝑎𝐴𝑏𝐵 𝑎 = (𝑓𝑏) ∧ ∀𝑐𝐶𝑑𝐷 𝑐 = (𝑔𝑑)) → ∀𝑎𝐴𝑐𝐶 (∃𝑏𝐵 𝑎 = (𝑓𝑏) ∧ ∃𝑑𝐷 𝑐 = (𝑔𝑑)))
21 pm3.2 462 . . . . . . . . . . . . . . . . . 18 (𝑎 = (𝑓𝑏) → (𝑐 = (𝑔𝑑) → (𝑎 = (𝑓𝑏) ∧ 𝑐 = (𝑔𝑑))))
2221reximdv 2999 . . . . . . . . . . . . . . . . 17 (𝑎 = (𝑓𝑏) → (∃𝑑𝐷 𝑐 = (𝑔𝑑) → ∃𝑑𝐷 (𝑎 = (𝑓𝑏) ∧ 𝑐 = (𝑔𝑑))))
2322com12 32 . . . . . . . . . . . . . . . 16 (∃𝑑𝐷 𝑐 = (𝑔𝑑) → (𝑎 = (𝑓𝑏) → ∃𝑑𝐷 (𝑎 = (𝑓𝑏) ∧ 𝑐 = (𝑔𝑑))))
2423reximdv 2999 . . . . . . . . . . . . . . 15 (∃𝑑𝐷 𝑐 = (𝑔𝑑) → (∃𝑏𝐵 𝑎 = (𝑓𝑏) → ∃𝑏𝐵𝑑𝐷 (𝑎 = (𝑓𝑏) ∧ 𝑐 = (𝑔𝑑))))
2524impcom 445 . . . . . . . . . . . . . 14 ((∃𝑏𝐵 𝑎 = (𝑓𝑏) ∧ ∃𝑑𝐷 𝑐 = (𝑔𝑑)) → ∃𝑏𝐵𝑑𝐷 (𝑎 = (𝑓𝑏) ∧ 𝑐 = (𝑔𝑑)))
2625ralimi 2936 . . . . . . . . . . . . 13 (∀𝑐𝐶 (∃𝑏𝐵 𝑎 = (𝑓𝑏) ∧ ∃𝑑𝐷 𝑐 = (𝑔𝑑)) → ∀𝑐𝐶𝑏𝐵𝑑𝐷 (𝑎 = (𝑓𝑏) ∧ 𝑐 = (𝑔𝑑)))
2726ralimi 2936 . . . . . . . . . . . 12 (∀𝑎𝐴𝑐𝐶 (∃𝑏𝐵 𝑎 = (𝑓𝑏) ∧ ∃𝑑𝐷 𝑐 = (𝑔𝑑)) → ∀𝑎𝐴𝑐𝐶𝑏𝐵𝑑𝐷 (𝑎 = (𝑓𝑏) ∧ 𝑐 = (𝑔𝑑)))
2820, 27syl 17 . . . . . . . . . . 11 ((∀𝑎𝐴𝑏𝐵 𝑎 = (𝑓𝑏) ∧ ∀𝑐𝐶𝑑𝐷 𝑐 = (𝑔𝑑)) → ∀𝑎𝐴𝑐𝐶𝑏𝐵𝑑𝐷 (𝑎 = (𝑓𝑏) ∧ 𝑐 = (𝑔𝑑)))
29 eqeq1 2614 . . . . . . . . . . . . . 14 (𝑥 = ⟨𝑎, 𝑐⟩ → (𝑥 = ⟨(𝑓𝑏), (𝑔𝑑)⟩ ↔ ⟨𝑎, 𝑐⟩ = ⟨(𝑓𝑏), (𝑔𝑑)⟩))
30 vex 3176 . . . . . . . . . . . . . . 15 𝑎 ∈ V
31 vex 3176 . . . . . . . . . . . . . . 15 𝑐 ∈ V
3230, 31opth 4871 . . . . . . . . . . . . . 14 (⟨𝑎, 𝑐⟩ = ⟨(𝑓𝑏), (𝑔𝑑)⟩ ↔ (𝑎 = (𝑓𝑏) ∧ 𝑐 = (𝑔𝑑)))
3329, 32syl6bb 275 . . . . . . . . . . . . 13 (𝑥 = ⟨𝑎, 𝑐⟩ → (𝑥 = ⟨(𝑓𝑏), (𝑔𝑑)⟩ ↔ (𝑎 = (𝑓𝑏) ∧ 𝑐 = (𝑔𝑑))))
34332rexbidv 3039 . . . . . . . . . . . 12 (𝑥 = ⟨𝑎, 𝑐⟩ → (∃𝑏𝐵𝑑𝐷 𝑥 = ⟨(𝑓𝑏), (𝑔𝑑)⟩ ↔ ∃𝑏𝐵𝑑𝐷 (𝑎 = (𝑓𝑏) ∧ 𝑐 = (𝑔𝑑))))
3534ralxp 5185 . . . . . . . . . . 11 (∀𝑥 ∈ (𝐴 × 𝐶)∃𝑏𝐵𝑑𝐷 𝑥 = ⟨(𝑓𝑏), (𝑔𝑑)⟩ ↔ ∀𝑎𝐴𝑐𝐶𝑏𝐵𝑑𝐷 (𝑎 = (𝑓𝑏) ∧ 𝑐 = (𝑔𝑑)))
3628, 35sylibr 223 . . . . . . . . . 10 ((∀𝑎𝐴𝑏𝐵 𝑎 = (𝑓𝑏) ∧ ∀𝑐𝐶𝑑𝐷 𝑐 = (𝑔𝑑)) → ∀𝑥 ∈ (𝐴 × 𝐶)∃𝑏𝐵𝑑𝐷 𝑥 = ⟨(𝑓𝑏), (𝑔𝑑)⟩)
3736r19.21bi 2916 . . . . . . . . 9 (((∀𝑎𝐴𝑏𝐵 𝑎 = (𝑓𝑏) ∧ ∀𝑐𝐶𝑑𝐷 𝑐 = (𝑔𝑑)) ∧ 𝑥 ∈ (𝐴 × 𝐶)) → ∃𝑏𝐵𝑑𝐷 𝑥 = ⟨(𝑓𝑏), (𝑔𝑑)⟩)
38 vex 3176 . . . . . . . . . . . . . 14 𝑏 ∈ V
39 vex 3176 . . . . . . . . . . . . . 14 𝑑 ∈ V
4038, 39op1std 7069 . . . . . . . . . . . . 13 (𝑦 = ⟨𝑏, 𝑑⟩ → (1st𝑦) = 𝑏)
4140fveq2d 6107 . . . . . . . . . . . 12 (𝑦 = ⟨𝑏, 𝑑⟩ → (𝑓‘(1st𝑦)) = (𝑓𝑏))
4238, 39op2ndd 7070 . . . . . . . . . . . . 13 (𝑦 = ⟨𝑏, 𝑑⟩ → (2nd𝑦) = 𝑑)
4342fveq2d 6107 . . . . . . . . . . . 12 (𝑦 = ⟨𝑏, 𝑑⟩ → (𝑔‘(2nd𝑦)) = (𝑔𝑑))
4441, 43opeq12d 4348 . . . . . . . . . . 11 (𝑦 = ⟨𝑏, 𝑑⟩ → ⟨(𝑓‘(1st𝑦)), (𝑔‘(2nd𝑦))⟩ = ⟨(𝑓𝑏), (𝑔𝑑)⟩)
4544eqeq2d 2620 . . . . . . . . . 10 (𝑦 = ⟨𝑏, 𝑑⟩ → (𝑥 = ⟨(𝑓‘(1st𝑦)), (𝑔‘(2nd𝑦))⟩ ↔ 𝑥 = ⟨(𝑓𝑏), (𝑔𝑑)⟩))
4645rexxp 5186 . . . . . . . . 9 (∃𝑦 ∈ (𝐵 × 𝐷)𝑥 = ⟨(𝑓‘(1st𝑦)), (𝑔‘(2nd𝑦))⟩ ↔ ∃𝑏𝐵𝑑𝐷 𝑥 = ⟨(𝑓𝑏), (𝑔𝑑)⟩)
4737, 46sylibr 223 . . . . . . . 8 (((∀𝑎𝐴𝑏𝐵 𝑎 = (𝑓𝑏) ∧ ∀𝑐𝐶𝑑𝐷 𝑐 = (𝑔𝑑)) ∧ 𝑥 ∈ (𝐴 × 𝐶)) → ∃𝑦 ∈ (𝐵 × 𝐷)𝑥 = ⟨(𝑓‘(1st𝑦)), (𝑔‘(2nd𝑦))⟩)
4847adantll 746 . . . . . . 7 ((((𝐴* 𝐵𝐶* 𝐷) ∧ (∀𝑎𝐴𝑏𝐵 𝑎 = (𝑓𝑏) ∧ ∀𝑐𝐶𝑑𝐷 𝑐 = (𝑔𝑑))) ∧ 𝑥 ∈ (𝐴 × 𝐶)) → ∃𝑦 ∈ (𝐵 × 𝐷)𝑥 = ⟨(𝑓‘(1st𝑦)), (𝑔‘(2nd𝑦))⟩)
4910, 15, 48wdom2d 8368 . . . . . 6 (((𝐴* 𝐵𝐶* 𝐷) ∧ (∀𝑎𝐴𝑏𝐵 𝑎 = (𝑓𝑏) ∧ ∀𝑐𝐶𝑑𝐷 𝑐 = (𝑔𝑑))) → (𝐴 × 𝐶) ≼* (𝐵 × 𝐷))
5049expr 641 . . . . 5 (((𝐴* 𝐵𝐶* 𝐷) ∧ ∀𝑎𝐴𝑏𝐵 𝑎 = (𝑓𝑏)) → (∀𝑐𝐶𝑑𝐷 𝑐 = (𝑔𝑑) → (𝐴 × 𝐶) ≼* (𝐵 × 𝐷)))
5150exlimdv 1848 . . . 4 (((𝐴* 𝐵𝐶* 𝐷) ∧ ∀𝑎𝐴𝑏𝐵 𝑎 = (𝑓𝑏)) → (∃𝑔𝑐𝐶𝑑𝐷 𝑐 = (𝑔𝑑) → (𝐴 × 𝐶) ≼* (𝐵 × 𝐷)))
5251ex 449 . . 3 ((𝐴* 𝐵𝐶* 𝐷) → (∀𝑎𝐴𝑏𝐵 𝑎 = (𝑓𝑏) → (∃𝑔𝑐𝐶𝑑𝐷 𝑐 = (𝑔𝑑) → (𝐴 × 𝐶) ≼* (𝐵 × 𝐷))))
5352exlimdv 1848 . 2 ((𝐴* 𝐵𝐶* 𝐷) → (∃𝑓𝑎𝐴𝑏𝐵 𝑎 = (𝑓𝑏) → (∃𝑔𝑐𝐶𝑑𝐷 𝑐 = (𝑔𝑑) → (𝐴 × 𝐶) ≼* (𝐵 × 𝐷))))
542, 4, 53mp2d 47 1 ((𝐴* 𝐵𝐶* 𝐷) → (𝐴 × 𝐶) ≼* (𝐵 × 𝐷))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383   = wceq 1475  wex 1695  wcel 1977  wral 2896  wrex 2897  Vcvv 3173  cop 4131   class class class wbr 4583   × cxp 5036  cfv 5804  1st c1st 7057  2nd c2nd 7058  * cwdom 8345
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-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-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  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-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-1st 7059  df-2nd 7060  df-er 7629  df-en 7842  df-dom 7843  df-sdom 7844  df-wdom 8347
This theorem is referenced by:  hsmexlem3  9133
  Copyright terms: Public domain W3C validator