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 39913
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 5969 . . 3 (𝐴 = 𝐵 → (◡ E ↾ 𝐴) = (◡ E ↾ 𝐵))
21disjeqd 39908 . 2 (𝐴 = 𝐵 → ( Disj (◡ E ↾ 𝐴) ↔ Disj (◡ E ↾ 𝐵)))
3 df-eldisj 39864 . 2 ( ElDisj 𝐴 ↔ Disj (◡ E ↾ 𝐴))
4 df-eldisj 39864 . 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 1569   E cep 5553  ◡ccnv 5653   ↾ cres 5656   Disj wdisjALTV 39291   ElDisj weldisj 39293
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-11 2196  ax-ext 2735  ax-sep 5251  ax-pr 5394
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4838  df-br 5106  df-opab 5170  df-id 5549  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-coss 39573  df-cnvrefrel 39679  df-funALTV 39839  df-disjALTV 39862  df-eldisj 39864
This theorem is used by:  eldisjeqi  39914  eldisjeqd  39915  eqvrelqseqdisj2  40004
  Copyright terms: Public domain W3C validator