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 40060
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 40025 . . 3 (𝑅 ∈ 𝑉 → ( QMap 𝑅 ∈ Disjs ↔ Disj QMap 𝑅))
2 disjimeceqim2 40005 . . . 4 ( Disj QMap 𝑅 → ((𝐴 ∈ dom QMap 𝑅 ∧ 𝐵 ∈ dom QMap 𝑅) → ([𝐴] QMap 𝑅 = [𝐵] QMap 𝑅 → 𝐴 = 𝐵)))
3 dmqmap 39653 . . . . . . . . . . 11 (𝑅 ∈ 𝑉 → dom QMap 𝑅 = dom 𝑅)
43eleq2d 2853 . . . . . . . . . 10 (𝑅 ∈ 𝑉 → (𝐴 ∈ dom QMap 𝑅 ↔ 𝐴 ∈ dom 𝑅))
53eleq2d 2853 . . . . . . . . . 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 39649 . . . . . . . . . . 11 (𝐴 ∈ dom 𝑅 → [𝐴] QMap 𝑅 = {[𝐴]𝑅})
10 ecqmap 39649 . . . . . . . . . . 11 (𝐵 ∈ dom 𝑅 → [𝐵] QMap 𝑅 = {[𝐵]𝑅})
119, 10eqeqan12d 2780 . . . . . . . . . 10 ((𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅) → ([𝐴] QMap 𝑅 = [𝐵] QMap 𝑅 ↔ {[𝐴]𝑅} = {[𝐵]𝑅}))
1211imbi1d 344 . . . . . . . . 9 ((𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅) → (([𝐴] QMap 𝑅 = [𝐵] QMap 𝑅 → 𝐴 = 𝐵) ↔ ({[𝐴]𝑅} = {[𝐵]𝑅} → 𝐴 = 𝐵)))
13 ecexg 8758 . . . . . . . . . . 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 1129 1 ((𝑅 ∈ 𝑉 ∧ QMap 𝑅 ∈ Disjs ∧ (𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅)) → ([𝐴]𝑅 = [𝐵]𝑅 → 𝐴 = 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1104   = wceq 1572   ∈ wcel 2150  Vcvv 3453  {csn 4587  dom cdm 5657  [cec 8752   QMap cqmap 39375   Disjs cdisjs 39418   Disj wdisjALTV 39419
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-id 5552  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-ec 8756  df-rels 39640  df-qmap 39646  df-coss 39701  df-ssr 39778  df-cnvrefs 39805  df-cnvrefrels 39806  df-cnvrefrel 39807  df-disjss 39988  df-disjs 39989  df-disjALTV 39990
This theorem is used by:  qmapeldisjsbi  40061  eldisjs6  40140
  Copyright terms: Public domain W3C validator