Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  disjxp1 Structured version   Visualization version   GIF version

Theorem disjxp1 43741
Description: The sets of a cartesian product are disjoint if the sets in the first argument are disjoint. (Contributed by Glauco Siliprandi, 11-Oct-2020.)
Hypothesis
Ref Expression
disjxp1.1 (𝜑Disj 𝑥𝐴 𝐵)
Assertion
Ref Expression
disjxp1 (𝜑Disj 𝑥𝐴 (𝐵 × 𝐶))
Distinct variable group:   𝑥,𝐴
Allowed substitution hints:   𝜑(𝑥)   𝐵(𝑥)   𝐶(𝑥)

Proof of Theorem disjxp1
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 animorrl 979 . . . 4 (((𝜑 ∧ (𝑦𝐴𝑧𝐴)) ∧ 𝑦 = 𝑧) → (𝑦 = 𝑧 ∨ (𝑦 / 𝑥(𝐵 × 𝐶) ∩ 𝑧 / 𝑥(𝐵 × 𝐶)) = ∅))
2 csbxp 5773 . . . . . . 7 𝑦 / 𝑥(𝐵 × 𝐶) = (𝑦 / 𝑥𝐵 × 𝑦 / 𝑥𝐶)
3 csbxp 5773 . . . . . . 7 𝑧 / 𝑥(𝐵 × 𝐶) = (𝑧 / 𝑥𝐵 × 𝑧 / 𝑥𝐶)
42, 3ineq12i 4209 . . . . . 6 (𝑦 / 𝑥(𝐵 × 𝐶) ∩ 𝑧 / 𝑥(𝐵 × 𝐶)) = ((𝑦 / 𝑥𝐵 × 𝑦 / 𝑥𝐶) ∩ (𝑧 / 𝑥𝐵 × 𝑧 / 𝑥𝐶))
5 simpll 765 . . . . . . . . 9 (((𝜑 ∧ (𝑦𝐴𝑧𝐴)) ∧ 𝑦𝑧) → 𝜑)
6 simplrl 775 . . . . . . . . 9 (((𝜑 ∧ (𝑦𝐴𝑧𝐴)) ∧ 𝑦𝑧) → 𝑦𝐴)
7 simplrr 776 . . . . . . . . 9 (((𝜑 ∧ (𝑦𝐴𝑧𝐴)) ∧ 𝑦𝑧) → 𝑧𝐴)
85, 6, 7jca31 515 . . . . . . . 8 (((𝜑 ∧ (𝑦𝐴𝑧𝐴)) ∧ 𝑦𝑧) → ((𝜑𝑦𝐴) ∧ 𝑧𝐴))
9 simpr 485 . . . . . . . . 9 (((𝜑 ∧ (𝑦𝐴𝑧𝐴)) ∧ 𝑦𝑧) → 𝑦𝑧)
109neneqd 2945 . . . . . . . 8 (((𝜑 ∧ (𝑦𝐴𝑧𝐴)) ∧ 𝑦𝑧) → ¬ 𝑦 = 𝑧)
11 disjxp1.1 . . . . . . . . . . . 12 (𝜑Disj 𝑥𝐴 𝐵)
12 disjors 5128 . . . . . . . . . . . 12 (Disj 𝑥𝐴 𝐵 ↔ ∀𝑦𝐴𝑧𝐴 (𝑦 = 𝑧 ∨ (𝑦 / 𝑥𝐵𝑧 / 𝑥𝐵) = ∅))
1311, 12sylib 217 . . . . . . . . . . 11 (𝜑 → ∀𝑦𝐴𝑧𝐴 (𝑦 = 𝑧 ∨ (𝑦 / 𝑥𝐵𝑧 / 𝑥𝐵) = ∅))
1413r19.21bi 3248 . . . . . . . . . 10 ((𝜑𝑦𝐴) → ∀𝑧𝐴 (𝑦 = 𝑧 ∨ (𝑦 / 𝑥𝐵𝑧 / 𝑥𝐵) = ∅))
1514r19.21bi 3248 . . . . . . . . 9 (((𝜑𝑦𝐴) ∧ 𝑧𝐴) → (𝑦 = 𝑧 ∨ (𝑦 / 𝑥𝐵𝑧 / 𝑥𝐵) = ∅))
1615ord 862 . . . . . . . 8 (((𝜑𝑦𝐴) ∧ 𝑧𝐴) → (¬ 𝑦 = 𝑧 → (𝑦 / 𝑥𝐵𝑧 / 𝑥𝐵) = ∅))
178, 10, 16sylc 65 . . . . . . 7 (((𝜑 ∧ (𝑦𝐴𝑧𝐴)) ∧ 𝑦𝑧) → (𝑦 / 𝑥𝐵𝑧 / 𝑥𝐵) = ∅)
18 xpdisj1 6157 . . . . . . 7 ((𝑦 / 𝑥𝐵𝑧 / 𝑥𝐵) = ∅ → ((𝑦 / 𝑥𝐵 × 𝑦 / 𝑥𝐶) ∩ (𝑧 / 𝑥𝐵 × 𝑧 / 𝑥𝐶)) = ∅)
1917, 18syl 17 . . . . . 6 (((𝜑 ∧ (𝑦𝐴𝑧𝐴)) ∧ 𝑦𝑧) → ((𝑦 / 𝑥𝐵 × 𝑦 / 𝑥𝐶) ∩ (𝑧 / 𝑥𝐵 × 𝑧 / 𝑥𝐶)) = ∅)
204, 19eqtrid 2784 . . . . 5 (((𝜑 ∧ (𝑦𝐴𝑧𝐴)) ∧ 𝑦𝑧) → (𝑦 / 𝑥(𝐵 × 𝐶) ∩ 𝑧 / 𝑥(𝐵 × 𝐶)) = ∅)
2120olcd 872 . . . 4 (((𝜑 ∧ (𝑦𝐴𝑧𝐴)) ∧ 𝑦𝑧) → (𝑦 = 𝑧 ∨ (𝑦 / 𝑥(𝐵 × 𝐶) ∩ 𝑧 / 𝑥(𝐵 × 𝐶)) = ∅))
221, 21pm2.61dane 3029 . . 3 ((𝜑 ∧ (𝑦𝐴𝑧𝐴)) → (𝑦 = 𝑧 ∨ (𝑦 / 𝑥(𝐵 × 𝐶) ∩ 𝑧 / 𝑥(𝐵 × 𝐶)) = ∅))
2322ralrimivva 3200 . 2 (𝜑 → ∀𝑦𝐴𝑧𝐴 (𝑦 = 𝑧 ∨ (𝑦 / 𝑥(𝐵 × 𝐶) ∩ 𝑧 / 𝑥(𝐵 × 𝐶)) = ∅))
24 disjors 5128 . 2 (Disj 𝑥𝐴 (𝐵 × 𝐶) ↔ ∀𝑦𝐴𝑧𝐴 (𝑦 = 𝑧 ∨ (𝑦 / 𝑥(𝐵 × 𝐶) ∩ 𝑧 / 𝑥(𝐵 × 𝐶)) = ∅))
2523, 24sylibr 233 1 (𝜑Disj 𝑥𝐴 (𝐵 × 𝐶))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 396  wo 845   = wceq 1541  wcel 2106  wne 2940  wral 3061  csb 3892  cin 3946  c0 4321  Disj wdisj 5112   × cxp 5673
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5298  ax-nul 5305  ax-pr 5426
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rmo 3376  df-rab 3433  df-v 3476  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-sn 4628  df-pr 4630  df-op 4634  df-disj 5113  df-opab 5210  df-xp 5681  df-rel 5682
This theorem is referenced by:  disjsnxp  43742
  Copyright terms: Public domain W3C validator