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 39983
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 39948 . . 3 (𝑅 ∈ 𝑉 → ( QMap 𝑅 ∈ Disjs ↔ Disj QMap 𝑅))
2 disjimeceqim2 39928 . . . 4 ( Disj QMap 𝑅 → ((𝐴 ∈ dom QMap 𝑅 ∧ 𝐵 ∈ dom QMap 𝑅) → ([𝐴] QMap 𝑅 = [𝐵] QMap 𝑅 → 𝐴 = 𝐵)))
3 dmqmap 39576 . . . . . . . . . . 11 (𝑅 ∈ 𝑉 → dom QMap 𝑅 = dom 𝑅)
43eleq2d 2850 . . . . . . . . . 10 (𝑅 ∈ 𝑉 → (𝐴 ∈ dom QMap 𝑅 ↔ 𝐴 ∈ dom 𝑅))
53eleq2d 2850 . . . . . . . . . 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 39572 . . . . . . . . . . 11 (𝐴 ∈ dom 𝑅 → [𝐴] QMap 𝑅 = {[𝐴]𝑅})
10 ecqmap 39572 . . . . . . . . . . 11 (𝐵 ∈ dom 𝑅 → [𝐵] QMap 𝑅 = {[𝐵]𝑅})
119, 10eqeqan12d 2777 . . . . . . . . . 10 ((𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅) → ([𝐴] QMap 𝑅 = [𝐵] QMap 𝑅 ↔ {[𝐴]𝑅} = {[𝐵]𝑅}))
1211imbi1d 344 . . . . . . . . 9 ((𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅) → (([𝐴] QMap 𝑅 = [𝐵] QMap 𝑅 → 𝐴 = 𝐵) ↔ ({[𝐴]𝑅} = {[𝐵]𝑅} → 𝐴 = 𝐵)))
13 ecexg 8746 . . . . . . . . . . 11 (𝑅 ∈ 𝑉 → [𝐴]𝑅 ∈ V)
14 sneqbg 4801 . . . . . . . . . . 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 1570   ∈ wcel 2147  Vcvv 3454  {csn 4588  dom cdm 5655  [cec 8740   QMap cqmap 39298   Disjs cdisjs 39341   Disj wdisjALTV 39342
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ec 8744  df-rels 39563  df-qmap 39569  df-coss 39624  df-ssr 39701  df-cnvrefs 39728  df-cnvrefrels 39729  df-cnvrefrel 39730  df-disjss 39911  df-disjs 39912  df-disjALTV 39913
This theorem is used by:  qmapeldisjsbi  39984  eldisjs6  40063
  Copyright terms: Public domain W3C validator