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

Theorem ecqmap 39649
Description: QMap fibers are singletons of blocks. Makes QMap behave like a "block constructor function" on dom 𝑅. (Contributed by Peter Mazsa, 14-Feb-2026.)
Assertion
Ref Expression
ecqmap (𝐴 ∈ dom 𝑅 → [𝐴] QMap 𝑅 = {[𝐴]𝑅})

Proof of Theorem ecqmap
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dfec2 8757 . 2 (𝐴 ∈ dom 𝑅 → [𝐴] QMap 𝑅 = {𝑦 ∣ 𝐴 QMap 𝑅𝑦})
2 eleq1 2855 . . . . . . . . . 10 (𝑥 = 𝐴 → (𝑥 ∈ dom 𝑅 ↔ 𝐴 ∈ dom 𝑅))
32adantr 486 . . . . . . . . 9 ((𝑥 = 𝐴 ∧ 𝑧 = 𝑦) → (𝑥 ∈ dom 𝑅 ↔ 𝐴 ∈ dom 𝑅))
4 eceq1 8794 . . . . . . . . . . 11 (𝑥 = 𝐴 → [𝑥]𝑅 = [𝐴]𝑅)
54eqeqan2d 39442 . . . . . . . . . 10 ((𝑧 = 𝑦 ∧ 𝑥 = 𝐴) → (𝑧 = [𝑥]𝑅 ↔ 𝑦 = [𝐴]𝑅))
65ancoms 464 . . . . . . . . 9 ((𝑥 = 𝐴 ∧ 𝑧 = 𝑦) → (𝑧 = [𝑥]𝑅 ↔ 𝑦 = [𝐴]𝑅))
73, 6anbi12d 644 . . . . . . . 8 ((𝑥 = 𝐴 ∧ 𝑧 = 𝑦) → ((𝑥 ∈ dom 𝑅 ∧ 𝑧 = [𝑥]𝑅) ↔ (𝐴 ∈ dom 𝑅 ∧ 𝑦 = [𝐴]𝑅)))
8 dfqmap3 39648 . . . . . . . 8 QMap 𝑅 = {⟨𝑥, 𝑧⟩ ∣ (𝑥 ∈ dom 𝑅 ∧ 𝑧 = [𝑥]𝑅)}
97, 8brabga 5514 . . . . . . 7 ((𝐴 ∈ dom 𝑅 ∧ 𝑦 ∈ V) → (𝐴 QMap 𝑅𝑦 ↔ (𝐴 ∈ dom 𝑅 ∧ 𝑦 = [𝐴]𝑅)))
109elvd 3459 . . . . . 6 (𝐴 ∈ dom 𝑅 → (𝐴 QMap 𝑅𝑦 ↔ (𝐴 ∈ dom 𝑅 ∧ 𝑦 = [𝐴]𝑅)))
1110abbidv 2832 . . . . 5 (𝐴 ∈ dom 𝑅 → {𝑦 ∣ 𝐴 QMap 𝑅𝑦} = {𝑦 ∣ (𝐴 ∈ dom 𝑅 ∧ 𝑦 = [𝐴]𝑅)})
12 inab 4256 . . . . 5 ({𝑦 ∣ 𝐴 ∈ dom 𝑅} ∩ {𝑦 ∣ 𝑦 = [𝐴]𝑅}) = {𝑦 ∣ (𝐴 ∈ dom 𝑅 ∧ 𝑦 = [𝐴]𝑅)}
1311, 12eqtr4di 2819 . . . 4 (𝐴 ∈ dom 𝑅 → {𝑦 ∣ 𝐴 QMap 𝑅𝑦} = ({𝑦 ∣ 𝐴 ∈ dom 𝑅} ∩ {𝑦 ∣ 𝑦 = [𝐴]𝑅}))
14 ax-5 1947 . . . . . . 7 (𝐴 ∈ dom 𝑅 → ∀𝑦 𝐴 ∈ dom 𝑅)
15 abv 3465 . . . . . . 7 ({𝑦 ∣ 𝐴 ∈ dom 𝑅} = V ↔ ∀𝑦 𝐴 ∈ dom 𝑅)
1614, 15sylibr 237 . . . . . 6 (𝐴 ∈ dom 𝑅 → {𝑦 ∣ 𝐴 ∈ dom 𝑅} = V)
1716ineq1d 4118 . . . . 5 (𝐴 ∈ dom 𝑅 → ({𝑦 ∣ 𝐴 ∈ dom 𝑅} ∩ {𝑦 ∣ 𝑦 = [𝐴]𝑅}) = (V ∩ {𝑦 ∣ 𝑦 = [𝐴]𝑅}))
18 inv1 4350 . . . . . 6 ({𝑦 ∣ 𝑦 = [𝐴]𝑅} ∩ V) = {𝑦 ∣ 𝑦 = [𝐴]𝑅}
1918ineqcomi 4110 . . . . 5 (V ∩ {𝑦 ∣ 𝑦 = [𝐴]𝑅}) = {𝑦 ∣ 𝑦 = [𝐴]𝑅}
2017, 19eqtrdi 2817 . . . 4 (𝐴 ∈ dom 𝑅 → ({𝑦 ∣ 𝐴 ∈ dom 𝑅} ∩ {𝑦 ∣ 𝑦 = [𝐴]𝑅}) = {𝑦 ∣ 𝑦 = [𝐴]𝑅})
2113, 20eqtrd 2801 . . 3 (𝐴 ∈ dom 𝑅 → {𝑦 ∣ 𝐴 QMap 𝑅𝑦} = {𝑦 ∣ 𝑦 = [𝐴]𝑅})
22 df-sn 4588 . . 3 {[𝐴]𝑅} = {𝑦 ∣ 𝑦 = [𝐴]𝑅}
2321, 22eqtr4di 2819 . 2 (𝐴 ∈ dom 𝑅 → {𝑦 ∣ 𝐴 QMap 𝑅𝑦} = {[𝐴]𝑅})
241, 23eqtrd 2801 1 (𝐴 ∈ dom 𝑅 → [𝐴] QMap 𝑅 = {[𝐴]𝑅})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1570   = wceq 1572   ∈ wcel 2150  {cab 2744  Vcvv 3453   ∩ cin 4091  {csn 4587   class class class wbr 5107  dom cdm 5657  [cec 8752   QMap cqmap 39375
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-11 2200  ax-ext 2738  ax-sep 5254  ax-pr 5397
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-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-ral 3084  df-rex 3094  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4840  df-br 5108  df-opab 5173  df-mpt 5192  df-xp 5663  df-cnv 5665  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-ec 8756  df-qmap 39646
This theorem is used by:  ecqmap2  39650  qmapeldisjsim  40060
  Copyright terms: Public domain W3C validator