Theorem ecqmap 38953

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.

Step	Hyp	Ref	Expression
1		dfec2 8683	. 2 ⊢ (𝐴 ∈ dom 𝑅 → [𝐴] QMap 𝑅 = {𝑦 ∣ 𝐴 QMap 𝑅𝑦})
2		eleq1 2852	. . . . . . . . . 10 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ dom 𝑅 ↔ 𝐴 ∈ dom 𝑅))
3	2	adantr 484	. . . . . . . . 9 ⊢ ((𝑥 = 𝐴 ∧ 𝑧 = 𝑦) → (𝑥 ∈ dom 𝑅 ↔ 𝐴 ∈ dom 𝑅))
4		eceq1 8720	. . . . . . . . . . 11 ⊢ (𝑥 = 𝐴 → [𝑥]𝑅 = [𝐴]𝑅)
5	4	eqeqan2d 38746	. . . . . . . . . 10 ⊢ ((𝑧 = 𝑦 ∧ 𝑥 = 𝐴) → (𝑧 = [𝑥]𝑅 ↔ 𝑦 = [𝐴]𝑅))
6	5	ancoms 462	. . . . . . . . 9 ⊢ ((𝑥 = 𝐴 ∧ 𝑧 = 𝑦) → (𝑧 = [𝑥]𝑅 ↔ 𝑦 = [𝐴]𝑅))
7	3, 6	anbi12d 641	. . . . . . . 8 ⊢ ((𝑥 = 𝐴 ∧ 𝑧 = 𝑦) → ((𝑥 ∈ dom 𝑅 ∧ 𝑧 = [𝑥]𝑅) ↔ (𝐴 ∈ dom 𝑅 ∧ 𝑦 = [𝐴]𝑅)))
8		dfqmap3 38952	. . . . . . . 8 ⊢ QMap 𝑅 = {⟨𝑥, 𝑧⟩ ∣ (𝑥 ∈ dom 𝑅 ∧ 𝑧 = [𝑥]𝑅)}
9	7, 8	brabga 5506	. . . . . . 7 ⊢ ((𝐴 ∈ dom 𝑅 ∧ 𝑦 ∈ V) → (𝐴 QMap 𝑅𝑦 ↔ (𝐴 ∈ dom 𝑅 ∧ 𝑦 = [𝐴]𝑅)))
10	9	elvd 3462	. . . . . 6 ⊢ (𝐴 ∈ dom 𝑅 → (𝐴 QMap 𝑅𝑦 ↔ (𝐴 ∈ dom 𝑅 ∧ 𝑦 = [𝐴]𝑅)))
11	10	abbidv 2830	. . . . 5 ⊢ (𝐴 ∈ dom 𝑅 → {𝑦 ∣ 𝐴 QMap 𝑅𝑦} = {𝑦 ∣ (𝐴 ∈ dom 𝑅 ∧ 𝑦 = [𝐴]𝑅)})
12		inab 4263	. . . . 5 ⊢ ({𝑦 ∣ 𝐴 ∈ dom 𝑅} ∩ {𝑦 ∣ 𝑦 = [𝐴]𝑅}) = {𝑦 ∣ (𝐴 ∈ dom 𝑅 ∧ 𝑦 = [𝐴]𝑅)}
13	11, 12	eqtr4di 2817	. . . 4 ⊢ (𝐴 ∈ dom 𝑅 → {𝑦 ∣ 𝐴 QMap 𝑅𝑦} = ({𝑦 ∣ 𝐴 ∈ dom 𝑅} ∩ {𝑦 ∣ 𝑦 = [𝐴]𝑅}))
14		ax-5 1932	. . . . . . 7 ⊢ (𝐴 ∈ dom 𝑅 → ∀𝑦 𝐴 ∈ dom 𝑅)
15		abv 3468	. . . . . . 7 ⊢ ({𝑦 ∣ 𝐴 ∈ dom 𝑅} = V ↔ ∀𝑦 𝐴 ∈ dom 𝑅)
16	14, 15	sylibr 236	. . . . . 6 ⊢ (𝐴 ∈ dom 𝑅 → {𝑦 ∣ 𝐴 ∈ dom 𝑅} = V)
17	16	ineq1d 4173	. . . . 5 ⊢ (𝐴 ∈ dom 𝑅 → ({𝑦 ∣ 𝐴 ∈ dom 𝑅} ∩ {𝑦 ∣ 𝑦 = [𝐴]𝑅}) = (V ∩ {𝑦 ∣ 𝑦 = [𝐴]𝑅}))
18		inv1 4354	. . . . . 6 ⊢ ({𝑦 ∣ 𝑦 = [𝐴]𝑅} ∩ V) = {𝑦 ∣ 𝑦 = [𝐴]𝑅}
19	18	ineqcomi 4165	. . . . 5 ⊢ (V ∩ {𝑦 ∣ 𝑦 = [𝐴]𝑅}) = {𝑦 ∣ 𝑦 = [𝐴]𝑅}
20	17, 19	eqtrdi 2815	. . . 4 ⊢ (𝐴 ∈ dom 𝑅 → ({𝑦 ∣ 𝐴 ∈ dom 𝑅} ∩ {𝑦 ∣ 𝑦 = [𝐴]𝑅}) = {𝑦 ∣ 𝑦 = [𝐴]𝑅})
21	13, 20	eqtrd 2799	. . 3 ⊢ (𝐴 ∈ dom 𝑅 → {𝑦 ∣ 𝐴 QMap 𝑅𝑦} = {𝑦 ∣ 𝑦 = [𝐴]𝑅})
22		df-sn 4585	. . 3 ⊢ {[𝐴]𝑅} = {𝑦 ∣ 𝑦 = [𝐴]𝑅}
23	21, 22	eqtr4di 2817	. 2 ⊢ (𝐴 ∈ dom 𝑅 → {𝑦 ∣ 𝐴 QMap 𝑅𝑦} = {[𝐴]𝑅})
24	1, 23	eqtrd 2799	1 ⊢ (𝐴 ∈ dom 𝑅 → [𝐴] QMap 𝑅 = {[𝐴]𝑅})

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 399  ∀wal 1560   = wceq 1562   ∈ wcel 2144  {cab 2742  Vcvv 3456   ∩ cin 3905  {csn 4584   class class class wbr 5102  dom cdm 5649  [cec 8678   QMap cqmap 38679

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-11 2193  ax-ext 2736  ax-sep 5248  ax-pr 5392

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-sb 2093  df-clab 2743  df-cleq 2756  df-clel 2839  df-ral 3079  df-rex 3089  df-rab 3417  df-v 3458  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5103  df-opab 5165  df-mpt 5184  df-xp 5655  df-cnv 5657  df-dm 5659  df-rn 5660  df-res 5661  df-ima 5662  df-ec 8682  df-qmap 38950

This theorem is referenced by:  ecqmap2  38954  qmapeldisjsim  39364