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 45524
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 988 . . . 4 (((𝜑 ∧ (𝑦𝐴𝑧𝐴)) ∧ 𝑦 = 𝑧) → (𝑦 = 𝑧 ∨ (𝑦 / 𝑥(𝐵 × 𝐶) ∩ 𝑧 / 𝑥(𝐵 × 𝐶)) = ∅))
2 csbxp 5726 . . . . . . 7 𝑦 / 𝑥(𝐵 × 𝐶) = (𝑦 / 𝑥𝐵 × 𝑦 / 𝑥𝐶)
3 csbxp 5726 . . . . . . 7 𝑧 / 𝑥(𝐵 × 𝐶) = (𝑧 / 𝑥𝐵 × 𝑧 / 𝑥𝐶)
42, 3ineq12i 4154 . . . . . 6 (𝑦 / 𝑥(𝐵 × 𝐶) ∩ 𝑧 / 𝑥(𝐵 × 𝐶)) = ((𝑦 / 𝑥𝐵 × 𝑦 / 𝑥𝐶) ∩ (𝑧 / 𝑥𝐵 × 𝑧 / 𝑥𝐶))
5 simpll 772 . . . . . . . . 9 (((𝜑 ∧ (𝑦𝐴𝑧𝐴)) ∧ 𝑦𝑧) → 𝜑)
6 simplrl 782 . . . . . . . . 9 (((𝜑 ∧ (𝑦𝐴𝑧𝐴)) ∧ 𝑦𝑧) → 𝑦𝐴)
7 simplrr 783 . . . . . . . . 9 (((𝜑 ∧ (𝑦𝐴𝑧𝐴)) ∧ 𝑦𝑧) → 𝑧𝐴)
85, 6, 7jca31 519 . . . . . . . 8 (((𝜑 ∧ (𝑦𝐴𝑧𝐴)) ∧ 𝑦𝑧) → ((𝜑𝑦𝐴) ∧ 𝑧𝐴))
9 simpr 485 . . . . . . . . 9 (((𝜑 ∧ (𝑦𝐴𝑧𝐴)) ∧ 𝑦𝑧) → 𝑦𝑧)
109neneqd 2940 . . . . . . . 8 (((𝜑 ∧ (𝑦𝐴𝑧𝐴)) ∧ 𝑦𝑧) → ¬ 𝑦 = 𝑧)
11 disjxp1.1 . . . . . . . . . . . 12 (𝜑Disj 𝑥𝐴 𝐵)
12 disjors 5062 . . . . . . . . . . . 12 (Disj 𝑥𝐴 𝐵 ↔ ∀𝑦𝐴𝑧𝐴 (𝑦 = 𝑧 ∨ (𝑦 / 𝑥𝐵𝑧 / 𝑥𝐵) = ∅))
1311, 12sylib 219 . . . . . . . . . . 11 (𝜑 → ∀𝑦𝐴𝑧𝐴 (𝑦 = 𝑧 ∨ (𝑦 / 𝑥𝐵𝑧 / 𝑥𝐵) = ∅))
1413r19.21bi 3232 . . . . . . . . . 10 ((𝜑𝑦𝐴) → ∀𝑧𝐴 (𝑦 = 𝑧 ∨ (𝑦 / 𝑥𝐵𝑧 / 𝑥𝐵) = ∅))
1514r19.21bi 3232 . . . . . . . . 9 (((𝜑𝑦𝐴) ∧ 𝑧𝐴) → (𝑦 = 𝑧 ∨ (𝑦 / 𝑥𝐵𝑧 / 𝑥𝐵) = ∅))
1615ord 870 . . . . . . . 8 (((𝜑𝑦𝐴) ∧ 𝑧𝐴) → (¬ 𝑦 = 𝑧 → (𝑦 / 𝑥𝐵𝑧 / 𝑥𝐵) = ∅))
178, 10, 16sylc 65 . . . . . . 7 (((𝜑 ∧ (𝑦𝐴𝑧𝐴)) ∧ 𝑦𝑧) → (𝑦 / 𝑥𝐵𝑧 / 𝑥𝐵) = ∅)
18 xpdisj1 6119 . . . . . . 7 ((𝑦 / 𝑥𝐵𝑧 / 𝑥𝐵) = ∅ → ((𝑦 / 𝑥𝐵 × 𝑦 / 𝑥𝐶) ∩ (𝑧 / 𝑥𝐵 × 𝑧 / 𝑥𝐶)) = ∅)
1917, 18syl 17 . . . . . 6 (((𝜑 ∧ (𝑦𝐴𝑧𝐴)) ∧ 𝑦𝑧) → ((𝑦 / 𝑥𝐵 × 𝑦 / 𝑥𝐶) ∩ (𝑧 / 𝑥𝐵 × 𝑧 / 𝑥𝐶)) = ∅)
204, 19eqtrid 2787 . . . . 5 (((𝜑 ∧ (𝑦𝐴𝑧𝐴)) ∧ 𝑦𝑧) → (𝑦 / 𝑥(𝐵 × 𝐶) ∩ 𝑧 / 𝑥(𝐵 × 𝐶)) = ∅)
2120olcd 880 . . . 4 (((𝜑 ∧ (𝑦𝐴𝑧𝐴)) ∧ 𝑦𝑧) → (𝑦 = 𝑧 ∨ (𝑦 / 𝑥(𝐵 × 𝐶) ∩ 𝑧 / 𝑥(𝐵 × 𝐶)) = ∅))
221, 21pm2.61dane 3022 . . 3 ((𝜑 ∧ (𝑦𝐴𝑧𝐴)) → (𝑦 = 𝑧 ∨ (𝑦 / 𝑥(𝐵 × 𝐶) ∩ 𝑧 / 𝑥(𝐵 × 𝐶)) = ∅))
2322ralrimivva 3183 . 2 (𝜑 → ∀𝑦𝐴𝑧𝐴 (𝑦 = 𝑧 ∨ (𝑦 / 𝑥(𝐵 × 𝐶) ∩ 𝑧 / 𝑥(𝐵 × 𝐶)) = ∅))
24 disjors 5062 . 2 (Disj 𝑥𝐴 (𝐵 × 𝐶) ↔ ∀𝑦𝐴𝑧𝐴 (𝑦 = 𝑧 ∨ (𝑦 / 𝑥(𝐵 × 𝐶) ∩ 𝑧 / 𝑥(𝐵 × 𝐶)) = ∅))
2523, 24sylibr 235 1 (𝜑Disj 𝑥𝐴 (𝐵 × 𝐶))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 396  wo 853   = wceq 1547  wcel 2119  wne 2935  wral 3054  csb 3838  cin 3889  c0 4268  Disj wdisj 5046   × cxp 5623
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-sep 5225  ax-pr 5369
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-rmo 3345  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-sn 4563  df-pr 4565  df-op 4569  df-disj 5047  df-opab 5142  df-xp 5631  df-rel 5632
This theorem is referenced by:  disjsnxp  45525
  Copyright terms: Public domain W3C validator