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

Theorem disj 4430
Description: Two ways of saying that two classes are disjoint (have no members in common). (Contributed by NM, 17-Feb-2004.) Avoid ax-10 2142, ax-11 2158, ax-12 2178. (Revised by GG, 28-Jun-2024.)
Assertion
Ref Expression
disj ((𝐴𝐵) = ∅ ↔ ∀𝑥𝐴 ¬ 𝑥𝐵)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem disj
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 df-in 3938 . . . 4 (𝐴𝐵) = {𝑧 ∣ (𝑧𝐴𝑧𝐵)}
21eqeq1i 2741 . . 3 ((𝐴𝐵) = ∅ ↔ {𝑧 ∣ (𝑧𝐴𝑧𝐵)} = ∅)
3 dfcleq 2729 . . . . 5 (∅ = {𝑧 ∣ (𝑧𝐴𝑧𝐵)} ↔ ∀𝑥(𝑥 ∈ ∅ ↔ 𝑥 ∈ {𝑧 ∣ (𝑧𝐴𝑧𝐵)}))
4 df-clab 2715 . . . . . . . 8 (𝑥 ∈ {𝑧 ∣ (𝑧𝐴𝑧𝐵)} ↔ [𝑥 / 𝑧](𝑧𝐴𝑧𝐵))
5 sb6 2086 . . . . . . . 8 ([𝑥 / 𝑧](𝑧𝐴𝑧𝐵) ↔ ∀𝑧(𝑧 = 𝑥 → (𝑧𝐴𝑧𝐵)))
6 id 22 . . . . . . . . . . 11 (𝑧 = 𝑥𝑧 = 𝑥)
7 eleq1w 2818 . . . . . . . . . . . . 13 (𝑧 = 𝑥 → (𝑧𝐴𝑥𝐴))
87biimpd 229 . . . . . . . . . . . 12 (𝑧 = 𝑥 → (𝑧𝐴𝑥𝐴))
9 eleq1w 2818 . . . . . . . . . . . . 13 (𝑧 = 𝑥 → (𝑧𝐵𝑥𝐵))
109biimpd 229 . . . . . . . . . . . 12 (𝑧 = 𝑥 → (𝑧𝐵𝑥𝐵))
118, 10anim12d 609 . . . . . . . . . . 11 (𝑧 = 𝑥 → ((𝑧𝐴𝑧𝐵) → (𝑥𝐴𝑥𝐵)))
126, 11embantd 59 . . . . . . . . . 10 (𝑧 = 𝑥 → ((𝑧 = 𝑥 → (𝑧𝐴𝑧𝐵)) → (𝑥𝐴𝑥𝐵)))
1312spimvw 1986 . . . . . . . . 9 (∀𝑧(𝑧 = 𝑥 → (𝑧𝐴𝑧𝐵)) → (𝑥𝐴𝑥𝐵))
14 eleq1a 2830 . . . . . . . . . . 11 (𝑥𝐴 → (𝑧 = 𝑥𝑧𝐴))
15 eleq1a 2830 . . . . . . . . . . 11 (𝑥𝐵 → (𝑧 = 𝑥𝑧𝐵))
1614, 15anim12ii 618 . . . . . . . . . 10 ((𝑥𝐴𝑥𝐵) → (𝑧 = 𝑥 → (𝑧𝐴𝑧𝐵)))
1716alrimiv 1927 . . . . . . . . 9 ((𝑥𝐴𝑥𝐵) → ∀𝑧(𝑧 = 𝑥 → (𝑧𝐴𝑧𝐵)))
1813, 17impbii 209 . . . . . . . 8 (∀𝑧(𝑧 = 𝑥 → (𝑧𝐴𝑧𝐵)) ↔ (𝑥𝐴𝑥𝐵))
194, 5, 183bitri 297 . . . . . . 7 (𝑥 ∈ {𝑧 ∣ (𝑧𝐴𝑧𝐵)} ↔ (𝑥𝐴𝑥𝐵))
2019bibi2i 337 . . . . . 6 ((𝑥 ∈ ∅ ↔ 𝑥 ∈ {𝑧 ∣ (𝑧𝐴𝑧𝐵)}) ↔ (𝑥 ∈ ∅ ↔ (𝑥𝐴𝑥𝐵)))
2120albii 1819 . . . . 5 (∀𝑥(𝑥 ∈ ∅ ↔ 𝑥 ∈ {𝑧 ∣ (𝑧𝐴𝑧𝐵)}) ↔ ∀𝑥(𝑥 ∈ ∅ ↔ (𝑥𝐴𝑥𝐵)))
223, 21bitri 275 . . . 4 (∅ = {𝑧 ∣ (𝑧𝐴𝑧𝐵)} ↔ ∀𝑥(𝑥 ∈ ∅ ↔ (𝑥𝐴𝑥𝐵)))
23 eqcom 2743 . . . 4 ({𝑧 ∣ (𝑧𝐴𝑧𝐵)} = ∅ ↔ ∅ = {𝑧 ∣ (𝑧𝐴𝑧𝐵)})
24 bicom 222 . . . . 5 (((𝑥𝐴𝑥𝐵) ↔ 𝑥 ∈ ∅) ↔ (𝑥 ∈ ∅ ↔ (𝑥𝐴𝑥𝐵)))
2524albii 1819 . . . 4 (∀𝑥((𝑥𝐴𝑥𝐵) ↔ 𝑥 ∈ ∅) ↔ ∀𝑥(𝑥 ∈ ∅ ↔ (𝑥𝐴𝑥𝐵)))
2622, 23, 253bitr4i 303 . . 3 ({𝑧 ∣ (𝑧𝐴𝑧𝐵)} = ∅ ↔ ∀𝑥((𝑥𝐴𝑥𝐵) ↔ 𝑥 ∈ ∅))
27 imnan 399 . . . . 5 ((𝑥𝐴 → ¬ 𝑥𝐵) ↔ ¬ (𝑥𝐴𝑥𝐵))
28 noel 4318 . . . . . 6 ¬ 𝑥 ∈ ∅
2928nbn 372 . . . . 5 (¬ (𝑥𝐴𝑥𝐵) ↔ ((𝑥𝐴𝑥𝐵) ↔ 𝑥 ∈ ∅))
3027, 29bitr2i 276 . . . 4 (((𝑥𝐴𝑥𝐵) ↔ 𝑥 ∈ ∅) ↔ (𝑥𝐴 → ¬ 𝑥𝐵))
3130albii 1819 . . 3 (∀𝑥((𝑥𝐴𝑥𝐵) ↔ 𝑥 ∈ ∅) ↔ ∀𝑥(𝑥𝐴 → ¬ 𝑥𝐵))
322, 26, 313bitri 297 . 2 ((𝐴𝐵) = ∅ ↔ ∀𝑥(𝑥𝐴 → ¬ 𝑥𝐵))
33 df-ral 3053 . 2 (∀𝑥𝐴 ¬ 𝑥𝐵 ↔ ∀𝑥(𝑥𝐴 → ¬ 𝑥𝐵))
3432, 33bitr4i 278 1 ((𝐴𝐵) = ∅ ↔ ∀𝑥𝐴 ¬ 𝑥𝐵)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wal 1538   = wceq 1540  [wsb 2065  wcel 2109  {cab 2714  wral 3052  cin 3930  c0 4313
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2708
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2715  df-cleq 2728  df-clel 2810  df-ral 3053  df-dif 3934  df-in 3938  df-nul 4314
This theorem is referenced by:  disjr  4431  disj1  4432  disjne  4435  disjord  5113  disjiund  5115  otiunsndisj  5500  dfpo2  6290  onxpdisj  6485  f0rn0  6768  onint  7789  zfreg  9614  kmlem4  10173  fin23lem30  10361  fin23lem31  10362  isf32lem3  10374  fpwwe2  10662  renfdisj  11300  fvinim0ffz  13807  s3iunsndisj  14992  metdsge  24794  ssltdisj  27790  dfpth2  29716  2wspmdisj  30323  subfacp1lem1  35206  disjabso  44967  dvmptfprodlem  45940  stoweidlem26  46022  stoweidlem59  46055  iundjiunlem  46455  otiunsndisjX  47275  upgrimpths  47889
  Copyright terms: Public domain W3C validator