Theorem disjss1f 32383

Description: A subset of a disjoint collection is disjoint. (Contributed by Thierry Arnoux, 6-Apr-2017.)

Hypotheses

Ref	Expression
disjss1f.1	⊢ Ⅎ𝑥𝐴
disjss1f.2	⊢ Ⅎ𝑥𝐵

Assertion

Ref	Expression
disjss1f	⊢ (𝐴 ⊆ 𝐵 → (Disj 𝑥 ∈ 𝐵 𝐶 → Disj 𝑥 ∈ 𝐴 𝐶))

Proof of Theorem disjss1f

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		disjss1f.1	. . . 4 ⊢ Ⅎ𝑥𝐴
2		disjss1f.2	. . . 4 ⊢ Ⅎ𝑥𝐵
3	1, 2	ssrmof 4049	. . 3 ⊢ (𝐴 ⊆ 𝐵 → (∃*𝑥 ∈ 𝐵 𝑦 ∈ 𝐶 → ∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐶))
4	3	alimdv 1911	. 2 ⊢ (𝐴 ⊆ 𝐵 → (∀𝑦∃*𝑥 ∈ 𝐵 𝑦 ∈ 𝐶 → ∀𝑦∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐶))
5		df-disj 5118	. 2 ⊢ (Disj 𝑥 ∈ 𝐵 𝐶 ↔ ∀𝑦∃*𝑥 ∈ 𝐵 𝑦 ∈ 𝐶)
6		df-disj 5118	. 2 ⊢ (Disj 𝑥 ∈ 𝐴 𝐶 ↔ ∀𝑦∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐶)
7	4, 5, 6	3imtr4g 295	1 ⊢ (𝐴 ⊆ 𝐵 → (Disj 𝑥 ∈ 𝐵 𝐶 → Disj 𝑥 ∈ 𝐴 𝐶))

Syntax hints:   → wi 4  ∀wal 1531   ∈ wcel 2098  Ⅎwnfc 2879  ∃*wrmo 3373   ⊆ wss 3949  Disj wdisj 5117

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-11 2146  ax-12 2166  ax-ext 2699

This theorem depends on definitions:  df-bi 206  df-an 395  df-tru 1536  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2529  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-rmo 3374  df-v 3475  df-in 3956  df-ss 3966  df-disj 5118

This theorem is referenced by:  disjeq1f  32384  esumrnmpt2  33720  measvuni  33866