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 39738
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 5995 . . 3 (𝐴 ⊆ 𝐵 → (◡ E ↾ 𝐴) ⊆ (◡ E ↾ 𝐵))
21disjssd 39733 . 2 (𝐴 ⊆ 𝐵 → ( Disj (◡ E ↾ 𝐵) → Disj (◡ E ↾ 𝐴)))
3 df-eldisj 39692 . 2 ( ElDisj 𝐵 ↔ Disj (◡ E ↾ 𝐵))
4 df-eldisj 39692 . 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 3899   E cep 5550  ◡ccnv 5650   ↾ cres 5653   Disj wdisjALTV 39119   ElDisj weldisj 39121
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-11 2194  ax-ext 2733  ax-sep 5249  ax-pr 5391
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 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-coss 39401  df-cnvrefrel 39507  df-funALTV 39667  df-disjALTV 39690  df-eldisj 39692
This theorem is used by:  eldisjssi  39739  eldisjssd  39740
  Copyright terms: Public domain W3C validator