Users' Mathboxes Mathbox for Peter Mazsa < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  qmapeldisjsim Structured version   Visualization version   GIF version

Theorem qmapeldisjsim 39793
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
StepHypRef Expression
1 qmapeldisjs 39758 . . 3 (𝑅 ∈ 𝑉 → ( QMap 𝑅 ∈ Disjs ↔ Disj QMap 𝑅))
2 disjimeceqim2 39738 . . . 4 ( Disj QMap 𝑅 → ((𝐴 ∈ dom QMap 𝑅 ∧ 𝐵 ∈ dom QMap 𝑅) → ([𝐴] QMap 𝑅 = [𝐵] QMap 𝑅 → 𝐴 = 𝐵)))
3 dmqmap 39386 . . . . . . . . . . 11 (𝑅 ∈ 𝑉 → dom QMap 𝑅 = dom 𝑅)
43eleq2d 2846 . . . . . . . . . 10 (𝑅 ∈ 𝑉 → (𝐴 ∈ dom QMap 𝑅 ↔ 𝐴 ∈ dom 𝑅))
53eleq2d 2846 . . . . . . . . . 10 (𝑅 ∈ 𝑉 → (𝐵 ∈ dom QMap 𝑅 ↔ 𝐵 ∈ dom 𝑅))
64, 5anbi12d 644 . . . . . . . . 9 (𝑅 ∈ 𝑉 → ((𝐴 ∈ dom QMap 𝑅 ∧ 𝐵 ∈ dom QMap 𝑅) ↔ (𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅)))
76pm5.32i 585 . . . . . . . 8 ((𝑅 ∈ 𝑉 ∧ (𝐴 ∈ dom QMap 𝑅 ∧ 𝐵 ∈ dom QMap 𝑅)) ↔ (𝑅 ∈ 𝑉 ∧ (𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅)))
87imbi1i 352 . . . . . . 7 (((𝑅 ∈ 𝑉 ∧ (𝐴 ∈ dom QMap 𝑅 ∧ 𝐵 ∈ dom QMap 𝑅)) → ([𝐴] QMap 𝑅 = [𝐵] QMap 𝑅 → 𝐴 = 𝐵)) ↔ ((𝑅 ∈ 𝑉 ∧ (𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅)) → ([𝐴] QMap 𝑅 = [𝐵] QMap 𝑅 → 𝐴 = 𝐵)))
9 ecqmap 39382 . . . . . . . . . . 11 (𝐴 ∈ dom 𝑅 → [𝐴] QMap 𝑅 = {[𝐴]𝑅})
10 ecqmap 39382 . . . . . . . . . . 11 (𝐵 ∈ dom 𝑅 → [𝐵] QMap 𝑅 = {[𝐵]𝑅})
119, 10eqeqan12d 2774 . . . . . . . . . 10 ((𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅) → ([𝐴] QMap 𝑅 = [𝐵] QMap 𝑅 ↔ {[𝐴]𝑅} = {[𝐵]𝑅}))
1211imbi1d 344 . . . . . . . . 9 ((𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅) → (([𝐴] QMap 𝑅 = [𝐵] QMap 𝑅 → 𝐴 = 𝐵) ↔ ({[𝐴]𝑅} = {[𝐵]𝑅} → 𝐴 = 𝐵)))
13 ecexg 8721 . . . . . . . . . . 11 (𝑅 ∈ 𝑉 → [𝐴]𝑅 ∈ V)
14 sneqbg 4802 . . . . . . . . . . 11 ([𝐴]𝑅 ∈ V → ({[𝐴]𝑅} = {[𝐵]𝑅} ↔ [𝐴]𝑅 = [𝐵]𝑅))
1513, 14syl 18 . . . . . . . . . 10 (𝑅 ∈ 𝑉 → ({[𝐴]𝑅} = {[𝐵]𝑅} ↔ [𝐴]𝑅 = [𝐵]𝑅))
1615imbi1d 344 . . . . . . . . 9 (𝑅 ∈ 𝑉 → (({[𝐴]𝑅} = {[𝐵]𝑅} → 𝐴 = 𝐵) ↔ ([𝐴]𝑅 = [𝐵]𝑅 → 𝐴 = 𝐵)))
1712, 16sylan9bbr 520 . . . . . . . 8 ((𝑅 ∈ 𝑉 ∧ (𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅)) → (([𝐴] QMap 𝑅 = [𝐵] QMap 𝑅 → 𝐴 = 𝐵) ↔ ([𝐴]𝑅 = [𝐵]𝑅 → 𝐴 = 𝐵)))
1817pm5.74i 274 . . . . . . 7 (((𝑅 ∈ 𝑉 ∧ (𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅)) → ([𝐴] QMap 𝑅 = [𝐵] QMap 𝑅 → 𝐴 = 𝐵)) ↔ ((𝑅 ∈ 𝑉 ∧ (𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅)) → ([𝐴]𝑅 = [𝐵]𝑅 → 𝐴 = 𝐵)))
198, 18bitri 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 𝑅) → ([𝐴]𝑅 = [𝐵]𝑅 → 𝐴 = 𝐵))))
2219, 20, 213bitr3i 304 . . . . 5 ((𝑅 ∈ 𝑉 → ((𝐴 ∈ dom QMap 𝑅 ∧ 𝐵 ∈ dom QMap 𝑅) → ([𝐴] QMap 𝑅 = [𝐵] QMap 𝑅 → 𝐴 = 𝐵))) ↔ (𝑅 ∈ 𝑉 → ((𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅) → ([𝐴]𝑅 = [𝐵]𝑅 → 𝐴 = 𝐵))))
2322pm5.74ri 275 . . . 4 (𝑅 ∈ 𝑉 → (((𝐴 ∈ dom QMap 𝑅 ∧ 𝐵 ∈ dom QMap 𝑅) → ([𝐴] QMap 𝑅 = [𝐵] QMap 𝑅 → 𝐴 = 𝐵)) ↔ ((𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅) → ([𝐴]𝑅 = [𝐵]𝑅 → 𝐴 = 𝐵))))
242, 23imbitrid 247 . . 3 (𝑅 ∈ 𝑉 → ( Disj QMap 𝑅 → ((𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅) → ([𝐴]𝑅 = [𝐵]𝑅 → 𝐴 = 𝐵))))
251, 24sylbid 243 . 2 (𝑅 ∈ 𝑉 → ( QMap 𝑅 ∈ Disjs → ((𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅) → ([𝐴]𝑅 = [𝐵]𝑅 → 𝐴 = 𝐵))))
26253imp 1128 1 ((𝑅 ∈ 𝑉 ∧ QMap 𝑅 ∈ Disjs ∧ (𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅)) → ([𝐴]𝑅 = [𝐵]𝑅 → 𝐴 = 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  Vcvv 3450  {csn 4583  dom cdm 5650  [cec 8715   QMap cqmap 39108   Disjs cdisjs 39151   Disj wdisjALTV 39152
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ec 8719  df-rels 39373  df-qmap 39379  df-coss 39434  df-ssr 39511  df-cnvrefs 39538  df-cnvrefrels 39539  df-cnvrefrel 39540  df-disjss 39721  df-disjs 39722  df-disjALTV 39723
This theorem is used by:  qmapeldisjsbi  39794  eldisjs6  39873
  Copyright terms: Public domain W3C validator