Theorem disjimeceqim2 39540

Description: Disj implies injectivity (pairwise form). The same content as disjimeceqim 39539 but packaged for direct use with explicit hypotheses (𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅). (Contributed by Peter Mazsa, 16-Feb-2026.)

Assertion

Ref	Expression
disjimeceqim2	⊢ ( Disj 𝑅 → ((𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅) → ([𝐴]𝑅 = [𝐵]𝑅 → 𝐴 = 𝐵)))

Proof of Theorem disjimeceqim2

Dummy variables 𝑢 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simprl 783	. . . 4 ⊢ (( Disj 𝑅 ∧ (𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅)) → 𝐴 ∈ dom 𝑅)
2		simprr 785	. . . 4 ⊢ (( Disj 𝑅 ∧ (𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅)) → 𝐵 ∈ dom 𝑅)
3		eleq1 2850	. . . . . 6 ⊢ (𝑢 = 𝐴 → (𝑢 ∈ dom 𝑅 ↔ 𝐴 ∈ dom 𝑅))
4		eleq1 2850	. . . . . 6 ⊢ (𝑣 = 𝐵 → (𝑣 ∈ dom 𝑅 ↔ 𝐵 ∈ dom 𝑅))
5	3, 4	bi2anan9 650	. . . . 5 ⊢ ((𝑢 = 𝐴 ∧ 𝑣 = 𝐵) → ((𝑢 ∈ dom 𝑅 ∧ 𝑣 ∈ dom 𝑅) ↔ (𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅)))
6		eceq1 8739	. . . . . . 7 ⊢ (𝑢 = 𝐴 → [𝑢]𝑅 = [𝐴]𝑅)
7		eceq1 8739	. . . . . . 7 ⊢ (𝑣 = 𝐵 → [𝑣]𝑅 = [𝐵]𝑅)
8	6, 7	eqeqan12d 2776	. . . . . 6 ⊢ ((𝑢 = 𝐴 ∧ 𝑣 = 𝐵) → ([𝑢]𝑅 = [𝑣]𝑅 ↔ [𝐴]𝑅 = [𝐵]𝑅))
9		eqeq12 2779	. . . . . 6 ⊢ ((𝑢 = 𝐴 ∧ 𝑣 = 𝐵) → (𝑢 = 𝑣 ↔ 𝐴 = 𝐵))
10	8, 9	imbi12d 347	. . . . 5 ⊢ ((𝑢 = 𝐴 ∧ 𝑣 = 𝐵) → (([𝑢]𝑅 = [𝑣]𝑅 → 𝑢 = 𝑣) ↔ ([𝐴]𝑅 = [𝐵]𝑅 → 𝐴 = 𝐵)))
11	5, 10	imbi12d 347	. . . 4 ⊢ ((𝑢 = 𝐴 ∧ 𝑣 = 𝐵) → (((𝑢 ∈ dom 𝑅 ∧ 𝑣 ∈ dom 𝑅) → ([𝑢]𝑅 = [𝑣]𝑅 → 𝑢 = 𝑣)) ↔ ((𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅) → ([𝐴]𝑅 = [𝐵]𝑅 → 𝐴 = 𝐵))))
12		disjimeceqim 39539	. . . . . 6 ⊢ ( Disj 𝑅 → ∀𝑢 ∈ dom 𝑅∀𝑣 ∈ dom 𝑅([𝑢]𝑅 = [𝑣]𝑅 → 𝑢 = 𝑣))
13		rsp2 3281	. . . . . 6 ⊢ (∀𝑢 ∈ dom 𝑅∀𝑣 ∈ dom 𝑅([𝑢]𝑅 = [𝑣]𝑅 → 𝑢 = 𝑣) → ((𝑢 ∈ dom 𝑅 ∧ 𝑣 ∈ dom 𝑅) → ([𝑢]𝑅 = [𝑣]𝑅 → 𝑢 = 𝑣)))
14	12, 13	syl 18	. . . . 5 ⊢ ( Disj 𝑅 → ((𝑢 ∈ dom 𝑅 ∧ 𝑣 ∈ dom 𝑅) → ([𝑢]𝑅 = [𝑣]𝑅 → 𝑢 = 𝑣)))
15	14	adantr 486	. . . 4 ⊢ (( Disj 𝑅 ∧ (𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅)) → ((𝑢 ∈ dom 𝑅 ∧ 𝑣 ∈ dom 𝑅) → ([𝑢]𝑅 = [𝑣]𝑅 → 𝑢 = 𝑣)))
16	1, 2, 11, 15	vtocl2d 3526	. . 3 ⊢ (( Disj 𝑅 ∧ (𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅)) → ((𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅) → ([𝐴]𝑅 = [𝐵]𝑅 → 𝐴 = 𝐵)))
17	16	ex 418	. 2 ⊢ ( Disj 𝑅 → ((𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅) → ((𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅) → ([𝐴]𝑅 = [𝐵]𝑅 → 𝐴 = 𝐵))))
18	17	pm2.43d 54	1 ⊢ ( Disj 𝑅 → ((𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅) → ([𝐴]𝑅 = [𝐵]𝑅 → 𝐴 = 𝐵)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3078  dom cdm 5659  [cec 8697   Disj wdisjALTV 38954

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-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-pr 5402

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-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-br 5108  df-opab 5172  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-ec 8701  df-coss 39236  df-cnvrefrel 39342  df-disjALTV 39525

This theorem is used by:  disjimeceqbi2  39542  qmapeldisjsim  39595