Theorem qmapeldisjsim 39595

Description: Injectivity of coset map from QMap being disjoint (implication form): under the Disjs condition on QMap 𝑅, the coset assignment is injective on dom 𝑅. (Contributed by Peter Mazsa, 16-Feb-2026.)

Assertion

Ref	Expression
qmapeldisjsim	⊢ ((𝑅 ∈ 𝑉 ∧ QMap 𝑅 ∈ Disjs ∧ (𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅)) → ([𝐴]𝑅 = [𝐵]𝑅 → 𝐴 = 𝐵))

Proof of Theorem qmapeldisjsim

Step	Hyp	Ref	Expression
1		qmapeldisjs 39560	. . 3 ⊢ (𝑅 ∈ 𝑉 → ( QMap 𝑅 ∈ Disjs ↔ Disj QMap 𝑅))
2		disjimeceqim2 39540	. . . 4 ⊢ ( Disj QMap 𝑅 → ((𝐴 ∈ dom QMap 𝑅 ∧ 𝐵 ∈ dom QMap 𝑅) → ([𝐴] QMap 𝑅 = [𝐵] QMap 𝑅 → 𝐴 = 𝐵)))
3		dmqmap 39188	. . . . . . . . . . 11 ⊢ (𝑅 ∈ 𝑉 → dom QMap 𝑅 = dom 𝑅)
4	3	eleq2d 2848	. . . . . . . . . 10 ⊢ (𝑅 ∈ 𝑉 → (𝐴 ∈ dom QMap 𝑅 ↔ 𝐴 ∈ dom 𝑅))
5	3	eleq2d 2848	. . . . . . . . . 10 ⊢ (𝑅 ∈ 𝑉 → (𝐵 ∈ dom QMap 𝑅 ↔ 𝐵 ∈ dom 𝑅))
6	4, 5	anbi12d 644	. . . . . . . . 9 ⊢ (𝑅 ∈ 𝑉 → ((𝐴 ∈ dom QMap 𝑅 ∧ 𝐵 ∈ dom QMap 𝑅) ↔ (𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅)))
7	6	pm5.32i 585	. . . . . . . 8 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝐴 ∈ dom QMap 𝑅 ∧ 𝐵 ∈ dom QMap 𝑅)) ↔ (𝑅 ∈ 𝑉 ∧ (𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅)))
8	7	imbi1i 352	. . . . . . 7 ⊢ (((𝑅 ∈ 𝑉 ∧ (𝐴 ∈ dom QMap 𝑅 ∧ 𝐵 ∈ dom QMap 𝑅)) → ([𝐴] QMap 𝑅 = [𝐵] QMap 𝑅 → 𝐴 = 𝐵)) ↔ ((𝑅 ∈ 𝑉 ∧ (𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅)) → ([𝐴] QMap 𝑅 = [𝐵] QMap 𝑅 → 𝐴 = 𝐵)))
9		ecqmap 39184	. . . . . . . . . . 11 ⊢ (𝐴 ∈ dom 𝑅 → [𝐴] QMap 𝑅 = {[𝐴]𝑅})
10		ecqmap 39184	. . . . . . . . . . 11 ⊢ (𝐵 ∈ dom 𝑅 → [𝐵] QMap 𝑅 = {[𝐵]𝑅})
11	9, 10	eqeqan12d 2776	. . . . . . . . . 10 ⊢ ((𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅) → ([𝐴] QMap 𝑅 = [𝐵] QMap 𝑅 ↔ {[𝐴]𝑅} = {[𝐵]𝑅}))
12	11	imbi1d 344	. . . . . . . . 9 ⊢ ((𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅) → (([𝐴] QMap 𝑅 = [𝐵] QMap 𝑅 → 𝐴 = 𝐵) ↔ ({[𝐴]𝑅} = {[𝐵]𝑅} → 𝐴 = 𝐵)))
13		ecexg 8703	. . . . . . . . . . 11 ⊢ (𝑅 ∈ 𝑉 → [𝐴]𝑅 ∈ V)
14		sneqbg 4806	. . . . . . . . . . 11 ⊢ ([𝐴]𝑅 ∈ V → ({[𝐴]𝑅} = {[𝐵]𝑅} ↔ [𝐴]𝑅 = [𝐵]𝑅))
15	13, 14	syl 18	. . . . . . . . . 10 ⊢ (𝑅 ∈ 𝑉 → ({[𝐴]𝑅} = {[𝐵]𝑅} ↔ [𝐴]𝑅 = [𝐵]𝑅))
16	15	imbi1d 344	. . . . . . . . 9 ⊢ (𝑅 ∈ 𝑉 → (({[𝐴]𝑅} = {[𝐵]𝑅} → 𝐴 = 𝐵) ↔ ([𝐴]𝑅 = [𝐵]𝑅 → 𝐴 = 𝐵)))
17	12, 16	sylan9bbr 520	. . . . . . . 8 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅)) → (([𝐴] QMap 𝑅 = [𝐵] QMap 𝑅 → 𝐴 = 𝐵) ↔ ([𝐴]𝑅 = [𝐵]𝑅 → 𝐴 = 𝐵)))
18	17	pm5.74i 274	. . . . . . 7 ⊢ (((𝑅 ∈ 𝑉 ∧ (𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅)) → ([𝐴] QMap 𝑅 = [𝐵] QMap 𝑅 → 𝐴 = 𝐵)) ↔ ((𝑅 ∈ 𝑉 ∧ (𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅)) → ([𝐴]𝑅 = [𝐵]𝑅 → 𝐴 = 𝐵)))
19	8, 18	bitri 278	. . . . . 6 ⊢ (((𝑅 ∈ 𝑉 ∧ (𝐴 ∈ dom QMap 𝑅 ∧ 𝐵 ∈ dom QMap 𝑅)) → ([𝐴] QMap 𝑅 = [𝐵] QMap 𝑅 → 𝐴 = 𝐵)) ↔ ((𝑅 ∈ 𝑉 ∧ (𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅)) → ([𝐴]𝑅 = [𝐵]𝑅 → 𝐴 = 𝐵)))
20		impexp 456	. . . . . 6 ⊢ (((𝑅 ∈ 𝑉 ∧ (𝐴 ∈ dom QMap 𝑅 ∧ 𝐵 ∈ dom QMap 𝑅)) → ([𝐴] QMap 𝑅 = [𝐵] QMap 𝑅 → 𝐴 = 𝐵)) ↔ (𝑅 ∈ 𝑉 → ((𝐴 ∈ dom QMap 𝑅 ∧ 𝐵 ∈ dom QMap 𝑅) → ([𝐴] QMap 𝑅 = [𝐵] QMap 𝑅 → 𝐴 = 𝐵))))
21		impexp 456	. . . . . 6 ⊢ (((𝑅 ∈ 𝑉 ∧ (𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅)) → ([𝐴]𝑅 = [𝐵]𝑅 → 𝐴 = 𝐵)) ↔ (𝑅 ∈ 𝑉 → ((𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅) → ([𝐴]𝑅 = [𝐵]𝑅 → 𝐴 = 𝐵))))
22	19, 20, 21	3bitr3i 304	. . . . 5 ⊢ ((𝑅 ∈ 𝑉 → ((𝐴 ∈ dom QMap 𝑅 ∧ 𝐵 ∈ dom QMap 𝑅) → ([𝐴] QMap 𝑅 = [𝐵] QMap 𝑅 → 𝐴 = 𝐵))) ↔ (𝑅 ∈ 𝑉 → ((𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅) → ([𝐴]𝑅 = [𝐵]𝑅 → 𝐴 = 𝐵))))
23	22	pm5.74ri 275	. . . 4 ⊢ (𝑅 ∈ 𝑉 → (((𝐴 ∈ dom QMap 𝑅 ∧ 𝐵 ∈ dom QMap 𝑅) → ([𝐴] QMap 𝑅 = [𝐵] QMap 𝑅 → 𝐴 = 𝐵)) ↔ ((𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅) → ([𝐴]𝑅 = [𝐵]𝑅 → 𝐴 = 𝐵))))
24	2, 23	imbitrid 247	. . 3 ⊢ (𝑅 ∈ 𝑉 → ( Disj QMap 𝑅 → ((𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅) → ([𝐴]𝑅 = [𝐵]𝑅 → 𝐴 = 𝐵))))
25	1, 24	sylbid 243	. 2 ⊢ (𝑅 ∈ 𝑉 → ( QMap 𝑅 ∈ Disjs → ((𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅) → ([𝐴]𝑅 = [𝐵]𝑅 → 𝐴 = 𝐵))))
26	25	3imp 1128	1 ⊢ ((𝑅 ∈ 𝑉 ∧ QMap 𝑅 ∈ Disjs ∧ (𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅)) → ([𝐴]𝑅 = [𝐵]𝑅 → 𝐴 = 𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  Vcvv 3453  {csn 4587  dom cdm 5659  [cec 8697   QMap cqmap 38910   Disjs cdisjs 38953   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-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739

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-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  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-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ec 8701  df-rels 39175  df-qmap 39181  df-coss 39236  df-ssr 39313  df-cnvrefs 39340  df-cnvrefrels 39341  df-cnvrefrel 39342  df-disjss 39523  df-disjs 39524  df-disjALTV 39525

This theorem is used by:  qmapeldisjsbi  39596  eldisjs6  39675