| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > eldisjeq | Structured version Visualization version GIF version | ||
| Description: Equality theorem for disjoint elementhood. (Contributed by Peter Mazsa, 23-Sep-2021.) |
| Ref | Expression |
|---|---|
| eldisjeq | ⊢ (𝐴 = 𝐵 → ( ElDisj 𝐴 ↔ ElDisj 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | reseq2 5933 | . . 3 ⊢ (𝐴 = 𝐵 → (◡ E ↾ 𝐴) = (◡ E ↾ 𝐵)) | |
| 2 | 1 | disjeqd 39171 | . 2 ⊢ (𝐴 = 𝐵 → ( Disj (◡ E ↾ 𝐴) ↔ Disj (◡ E ↾ 𝐵))) |
| 3 | df-eldisj 39127 | . 2 ⊢ ( ElDisj 𝐴 ↔ Disj (◡ E ↾ 𝐴)) | |
| 4 | df-eldisj 39127 | . 2 ⊢ ( ElDisj 𝐵 ↔ Disj (◡ E ↾ 𝐵)) | |
| 5 | 2, 3, 4 | 3bitr4g 314 | 1 ⊢ (𝐴 = 𝐵 → ( ElDisj 𝐴 ↔ ElDisj 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1542 E cep 5523 ◡ccnv 5623 ↾ cres 5626 Disj wdisjALTV 38554 ElDisj weldisj 38556 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-11 2163 ax-ext 2709 ax-sep 5231 ax-pr 5370 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-br 5087 df-opab 5149 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-coss 38836 df-cnvrefrel 38942 df-funALTV 39102 df-disjALTV 39125 df-eldisj 39127 |
| This theorem is referenced by: eldisjeqi 39177 eldisjeqd 39178 eqvrelqseqdisj2 39267 |
| Copyright terms: Public domain | W3C validator |