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

Theorem ssxpb 6024
 Description: A Cartesian product subclass relationship is equivalent to the conjunction of the analogous relationships for the factors. (Contributed by NM, 17-Dec-2008.)
Assertion
Ref Expression
ssxpb ((𝐴 × 𝐵) ≠ ∅ → ((𝐴 × 𝐵) ⊆ (𝐶 × 𝐷) ↔ (𝐴𝐶𝐵𝐷)))

Proof of Theorem ssxpb
StepHypRef Expression
1 xpnz 6009 . . . . . . . 8 ((𝐴 ≠ ∅ ∧ 𝐵 ≠ ∅) ↔ (𝐴 × 𝐵) ≠ ∅)
2 dmxp 5792 . . . . . . . . 9 (𝐵 ≠ ∅ → dom (𝐴 × 𝐵) = 𝐴)
32adantl 484 . . . . . . . 8 ((𝐴 ≠ ∅ ∧ 𝐵 ≠ ∅) → dom (𝐴 × 𝐵) = 𝐴)
41, 3sylbir 237 . . . . . . 7 ((𝐴 × 𝐵) ≠ ∅ → dom (𝐴 × 𝐵) = 𝐴)
54adantr 483 . . . . . 6 (((𝐴 × 𝐵) ≠ ∅ ∧ (𝐴 × 𝐵) ⊆ (𝐶 × 𝐷)) → dom (𝐴 × 𝐵) = 𝐴)
6 dmss 5764 . . . . . . 7 ((𝐴 × 𝐵) ⊆ (𝐶 × 𝐷) → dom (𝐴 × 𝐵) ⊆ dom (𝐶 × 𝐷))
76adantl 484 . . . . . 6 (((𝐴 × 𝐵) ≠ ∅ ∧ (𝐴 × 𝐵) ⊆ (𝐶 × 𝐷)) → dom (𝐴 × 𝐵) ⊆ dom (𝐶 × 𝐷))
85, 7eqsstrrd 4004 . . . . 5 (((𝐴 × 𝐵) ≠ ∅ ∧ (𝐴 × 𝐵) ⊆ (𝐶 × 𝐷)) → 𝐴 ⊆ dom (𝐶 × 𝐷))
9 dmxpss 6021 . . . . 5 dom (𝐶 × 𝐷) ⊆ 𝐶
108, 9sstrdi 3977 . . . 4 (((𝐴 × 𝐵) ≠ ∅ ∧ (𝐴 × 𝐵) ⊆ (𝐶 × 𝐷)) → 𝐴𝐶)
11 rnxp 6020 . . . . . . . . 9 (𝐴 ≠ ∅ → ran (𝐴 × 𝐵) = 𝐵)
1211adantr 483 . . . . . . . 8 ((𝐴 ≠ ∅ ∧ 𝐵 ≠ ∅) → ran (𝐴 × 𝐵) = 𝐵)
131, 12sylbir 237 . . . . . . 7 ((𝐴 × 𝐵) ≠ ∅ → ran (𝐴 × 𝐵) = 𝐵)
1413adantr 483 . . . . . 6 (((𝐴 × 𝐵) ≠ ∅ ∧ (𝐴 × 𝐵) ⊆ (𝐶 × 𝐷)) → ran (𝐴 × 𝐵) = 𝐵)
15 rnss 5802 . . . . . . 7 ((𝐴 × 𝐵) ⊆ (𝐶 × 𝐷) → ran (𝐴 × 𝐵) ⊆ ran (𝐶 × 𝐷))
1615adantl 484 . . . . . 6 (((𝐴 × 𝐵) ≠ ∅ ∧ (𝐴 × 𝐵) ⊆ (𝐶 × 𝐷)) → ran (𝐴 × 𝐵) ⊆ ran (𝐶 × 𝐷))
1714, 16eqsstrrd 4004 . . . . 5 (((𝐴 × 𝐵) ≠ ∅ ∧ (𝐴 × 𝐵) ⊆ (𝐶 × 𝐷)) → 𝐵 ⊆ ran (𝐶 × 𝐷))
18 rnxpss 6022 . . . . 5 ran (𝐶 × 𝐷) ⊆ 𝐷
1917, 18sstrdi 3977 . . . 4 (((𝐴 × 𝐵) ≠ ∅ ∧ (𝐴 × 𝐵) ⊆ (𝐶 × 𝐷)) → 𝐵𝐷)
2010, 19jca 514 . . 3 (((𝐴 × 𝐵) ≠ ∅ ∧ (𝐴 × 𝐵) ⊆ (𝐶 × 𝐷)) → (𝐴𝐶𝐵𝐷))
2120ex 415 . 2 ((𝐴 × 𝐵) ≠ ∅ → ((𝐴 × 𝐵) ⊆ (𝐶 × 𝐷) → (𝐴𝐶𝐵𝐷)))
22 xpss12 5563 . 2 ((𝐴𝐶𝐵𝐷) → (𝐴 × 𝐵) ⊆ (𝐶 × 𝐷))
2321, 22impbid1 227 1 ((𝐴 × 𝐵) ≠ ∅ → ((𝐴 × 𝐵) ⊆ (𝐶 × 𝐷) ↔ (𝐴𝐶𝐵𝐷)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   = wceq 1530   ≠ wne 3014   ⊆ wss 3934  ∅c0 4289   × cxp 5546  dom cdm 5548  ran crn 5549 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 1904  ax-6 1963  ax-7 2008  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2153  ax-12 2169  ax-ext 2791  ax-sep 5194  ax-nul 5201  ax-pr 5320 This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1083  df-tru 1533  df-ex 1774  df-nf 1778  df-sb 2063  df-mo 2616  df-eu 2648  df-clab 2798  df-cleq 2812  df-clel 2891  df-nfc 2961  df-ne 3015  df-ral 3141  df-rex 3142  df-rab 3145  df-v 3495  df-dif 3937  df-un 3939  df-in 3941  df-ss 3950  df-nul 4290  df-if 4466  df-sn 4560  df-pr 4562  df-op 4566  df-br 5058  df-opab 5120  df-xp 5554  df-rel 5555  df-cnv 5556  df-dm 5558  df-rn 5559 This theorem is referenced by:  xp11  6025  dibord  38282
 Copyright terms: Public domain W3C validator