Theorem disjif 32592

Description: Property of a disjoint collection: if 𝐵(𝑥) and 𝐵(𝑌) = 𝐷 have a common element 𝑍, then 𝑥 = 𝑌. (Contributed by Thierry Arnoux, 30-Dec-2016.)

Hypotheses

Ref	Expression
disjif.1	⊢ Ⅎ𝑥𝐶
disjif.2	⊢ (𝑥 = 𝑌 → 𝐵 = 𝐶)

Assertion

Ref	Expression
disjif	⊢ ((Disj 𝑥 ∈ 𝐴 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) ∧ (𝑍 ∈ 𝐵 ∧ 𝑍 ∈ 𝐶)) → 𝑥 = 𝑌)

Distinct variable groups:   𝑥,𝐴   𝑥,𝑌

Allowed substitution hints:   𝐵(𝑥)   𝐶(𝑥)   𝑍(𝑥)

Proof of Theorem disjif

Step	Hyp	Ref	Expression
1		inelcm 4464	. 2 ⊢ ((𝑍 ∈ 𝐵 ∧ 𝑍 ∈ 𝐶) → (𝐵 ∩ 𝐶) ≠ ∅)
2		disjif.1	. . . . . 6 ⊢ Ⅎ𝑥𝐶
3		disjif.2	. . . . . 6 ⊢ (𝑥 = 𝑌 → 𝐵 = 𝐶)
4	2, 3	disji2f 32591	. . . . 5 ⊢ ((Disj 𝑥 ∈ 𝐴 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) ∧ 𝑥 ≠ 𝑌) → (𝐵 ∩ 𝐶) = ∅)
5	4	3expia 1121	. . . 4 ⊢ ((Disj 𝑥 ∈ 𝐴 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → (𝑥 ≠ 𝑌 → (𝐵 ∩ 𝐶) = ∅))
6	5	necon1d 2961	. . 3 ⊢ ((Disj 𝑥 ∈ 𝐴 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → ((𝐵 ∩ 𝐶) ≠ ∅ → 𝑥 = 𝑌))
7	6	3impia 1117	. 2 ⊢ ((Disj 𝑥 ∈ 𝐴 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) ∧ (𝐵 ∩ 𝐶) ≠ ∅) → 𝑥 = 𝑌)
8	1, 7	syl3an3 1165	1 ⊢ ((Disj 𝑥 ∈ 𝐴 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) ∧ (𝑍 ∈ 𝐵 ∧ 𝑍 ∈ 𝐶)) → 𝑥 = 𝑌)

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1539   ∈ wcel 2107  Ⅎwnfc 2889   ≠ wne 2939   ∩ cin 3949  ∅c0 4332  Disj wdisj 5109

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2707

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2539  df-clab 2714  df-cleq 2728  df-clel 2815  df-nfc 2891  df-ne 2940  df-ral 3061  df-rmo 3379  df-rab 3436  df-v 3481  df-sbc 3788  df-csb 3899  df-dif 3953  df-in 3957  df-nul 4333  df-disj 5110

This theorem is referenced by:  disjabrex  32596  2ndresdju  32660