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

Theorem eldisjss 39973
Description: Subclass theorem for disjoint elementhood. (Contributed by Peter Mazsa, 23-Sep-2021.)
Assertion
Ref Expression
eldisjss (𝐴 ⊆ 𝐵 → ( ElDisj 𝐵 → ElDisj 𝐴))

Proof of Theorem eldisjss
StepHypRef Expression
1 ssres2 6007 . . 3 (𝐴 ⊆ 𝐵 → (◡ E ↾ 𝐴) ⊆ (◡ E ↾ 𝐵))
21disjssd 39968 . 2 (𝐴 ⊆ 𝐵 → ( Disj (◡ E ↾ 𝐵) → Disj (◡ E ↾ 𝐴)))
3 df-eldisj 39927 . 2 ( ElDisj 𝐵 ↔ Disj (◡ E ↾ 𝐵))
4 df-eldisj 39927 . 2 ( ElDisj 𝐴 ↔ Disj (◡ E ↾ 𝐴))
52, 3, 43imtr4g 299 1 (𝐴 ⊆ 𝐵 → ( ElDisj 𝐵 → ElDisj 𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ⊆ wss 3900   E cep 5555  ◡ccnv 5655   ↾ cres 5658   Disj wdisjALTV 39354   ElDisj weldisj 39356
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 5253  ax-pr 5396
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 4839  df-br 5107  df-opab 5172  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-coss 39636  df-cnvrefrel 39742  df-funALTV 39902  df-disjALTV 39925  df-eldisj 39927
This theorem is used by:  eldisjssi  39974  eldisjssd  39975
  Copyright terms: Public domain W3C validator