Users' Mathboxes Mathbox for Peter Mazsa < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  eldisjeq Structured version   Visualization version   GIF version

Theorem eldisjeq 40039
Description: Equality theorem for disjoint elementhood. (Contributed by Peter Mazsa, 23-Sep-2021.)
Assertion
Ref Expression
eldisjeq (𝐴 = 𝐵 → ( ElDisj 𝐴 ↔ ElDisj 𝐵))

Proof of Theorem eldisjeq
StepHypRef Expression
1 reseq2 5981 . . 3 (𝐴 = 𝐵 → (◡ E ↾ 𝐴) = (◡ E ↾ 𝐵))
21disjeqd 40034 . 2 (𝐴 = 𝐵 → ( Disj (◡ E ↾ 𝐴) ↔ Disj (◡ E ↾ 𝐵)))
3 df-eldisj 39990 . 2 ( ElDisj 𝐴 ↔ Disj (◡ E ↾ 𝐴))
4 df-eldisj 39990 . 2 ( ElDisj 𝐵 ↔ Disj (◡ E ↾ 𝐵))
52, 3, 43bitr4g 317 1 (𝐴 = 𝐵 → ( ElDisj 𝐴 ↔ ElDisj 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   E cep 5557  ◡ccnv 5657   ↾ cres 5660   Disj wdisjALTV 39417   ElDisj weldisj 39419
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-11 2197  ax-ext 2735  ax-sep 5255  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-coss 39699  df-cnvrefrel 39805  df-funALTV 39965  df-disjALTV 39988  df-eldisj 39990
This theorem is used by:  eldisjeqi  40040  eldisjeqd  40041  eqvrelqseqdisj2  40130
  Copyright terms: Public domain W3C validator