Theorem disjss 40029

Description: Subclass theorem for disjoints. (Contributed by Peter Mazsa, 28-Oct-2020.) (Revised by Peter Mazsa, 22-Sep-2021.)

Assertion

Ref	Expression
disjss	⊢ (𝐴 ⊆ 𝐵 → ( Disj 𝐵 → Disj 𝐴))

Proof of Theorem disjss

Step	Hyp	Ref	Expression
1		cnvss 5862	. . . 4 ⊢ (𝐴 ⊆ 𝐵 → ◡𝐴 ⊆ ◡𝐵)
2		funALTVss 39982	. . . 4 ⊢ (◡𝐴 ⊆ ◡𝐵 → ( FunALTV ◡𝐵 → FunALTV ◡𝐴))
3	1, 2	syl 18	. . 3 ⊢ (𝐴 ⊆ 𝐵 → ( FunALTV ◡𝐵 → FunALTV ◡𝐴))
4		relss 5766	. . 3 ⊢ (𝐴 ⊆ 𝐵 → (Rel 𝐵 → Rel 𝐴))
5	3, 4	anim12d 621	. 2 ⊢ (𝐴 ⊆ 𝐵 → (( FunALTV ◡𝐵 ∧ Rel 𝐵) → ( FunALTV ◡𝐴 ∧ Rel 𝐴)))
6		dfdisjALTV 39996	. 2 ⊢ ( Disj 𝐵 ↔ ( FunALTV ◡𝐵 ∧ Rel 𝐵))
7		dfdisjALTV 39996	. 2 ⊢ ( Disj 𝐴 ↔ ( FunALTV ◡𝐴 ∧ Rel 𝐴))
8	5, 6, 7	3imtr4g 299	1 ⊢ (𝐴 ⊆ 𝐵 → ( Disj 𝐵 → Disj 𝐴))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ⊆ wss 3900  ^◡ccnv 5657  Rel wrel 5663   FunALTV wfunALTV 39414   Disj wdisjALTV 39417

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

This theorem is used by:  disjssi  40030  disjssd  40031