Theorem ecqmap 39301

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 8698	. 2 ⊢ (𝐴 ∈ dom 𝑅 → [𝐴] QMap 𝑅 = {𝑦 ∣ 𝐴 QMap 𝑅𝑦})
2		eleq1 2848	. . . . . . . . . 10 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ dom 𝑅 ↔ 𝐴 ∈ dom 𝑅))
3	2	adantr 486	. . . . . . . . 9 ⊢ ((𝑥 = 𝐴 ∧ 𝑧 = 𝑦) → (𝑥 ∈ dom 𝑅 ↔ 𝐴 ∈ dom 𝑅))
4		eceq1 8735	. . . . . . . . . . 11 ⊢ (𝑥 = 𝐴 → [𝑥]𝑅 = [𝐴]𝑅)
5	4	eqeqan2d 39094	. . . . . . . . . 10 ⊢ ((𝑧 = 𝑦 ∧ 𝑥 = 𝐴) → (𝑧 = [𝑥]𝑅 ↔ 𝑦 = [𝐴]𝑅))
6	5	ancoms 464	. . . . . . . . 9 ⊢ ((𝑥 = 𝐴 ∧ 𝑧 = 𝑦) → (𝑧 = [𝑥]𝑅 ↔ 𝑦 = [𝐴]𝑅))
7	3, 6	anbi12d 644	. . . . . . . 8 ⊢ ((𝑥 = 𝐴 ∧ 𝑧 = 𝑦) → ((𝑥 ∈ dom 𝑅 ∧ 𝑧 = [𝑥]𝑅) ↔ (𝐴 ∈ dom 𝑅 ∧ 𝑦 = [𝐴]𝑅)))
8		dfqmap3 39300	. . . . . . . 8 ⊢ QMap 𝑅 = {⟨𝑥, 𝑧⟩ ∣ (𝑥 ∈ dom 𝑅 ∧ 𝑧 = [𝑥]𝑅)}
9	7, 8	brabga 5504	. . . . . . 7 ⊢ ((𝐴 ∈ dom 𝑅 ∧ 𝑦 ∈ V) → (𝐴 QMap 𝑅𝑦 ↔ (𝐴 ∈ dom 𝑅 ∧ 𝑦 = [𝐴]𝑅)))
10	9	elvd 3456	. . . . . 6 ⊢ (𝐴 ∈ dom 𝑅 → (𝐴 QMap 𝑅𝑦 ↔ (𝐴 ∈ dom 𝑅 ∧ 𝑦 = [𝐴]𝑅)))
11	10	abbidv 2826	. . . . 5 ⊢ (𝐴 ∈ dom 𝑅 → {𝑦 ∣ 𝐴 QMap 𝑅𝑦} = {𝑦 ∣ (𝐴 ∈ dom 𝑅 ∧ 𝑦 = [𝐴]𝑅)})
12		inab 4254	. . . . 5 ⊢ ({𝑦 ∣ 𝐴 ∈ dom 𝑅} ∩ {𝑦 ∣ 𝑦 = [𝐴]𝑅}) = {𝑦 ∣ (𝐴 ∈ dom 𝑅 ∧ 𝑦 = [𝐴]𝑅)}
13	11, 12	eqtr4di 2813	. . . 4 ⊢ (𝐴 ∈ dom 𝑅 → {𝑦 ∣ 𝐴 QMap 𝑅𝑦} = ({𝑦 ∣ 𝐴 ∈ dom 𝑅} ∩ {𝑦 ∣ 𝑦 = [𝐴]𝑅}))
14		ax-5 1943	. . . . . . 7 ⊢ (𝐴 ∈ dom 𝑅 → ∀𝑦 𝐴 ∈ dom 𝑅)
15		abv 3462	. . . . . . 7 ⊢ ({𝑦 ∣ 𝐴 ∈ dom 𝑅} = V ↔ ∀𝑦 𝐴 ∈ dom 𝑅)
16	14, 15	sylibr 237	. . . . . 6 ⊢ (𝐴 ∈ dom 𝑅 → {𝑦 ∣ 𝐴 ∈ dom 𝑅} = V)
17	16	ineq1d 4164	. . . . 5 ⊢ (𝐴 ∈ dom 𝑅 → ({𝑦 ∣ 𝐴 ∈ dom 𝑅} ∩ {𝑦 ∣ 𝑦 = [𝐴]𝑅}) = (V ∩ {𝑦 ∣ 𝑦 = [𝐴]𝑅}))
18		inv1 4347	. . . . . 6 ⊢ ({𝑦 ∣ 𝑦 = [𝐴]𝑅} ∩ V) = {𝑦 ∣ 𝑦 = [𝐴]𝑅}
19	18	ineqcomi 4156	. . . . 5 ⊢ (V ∩ {𝑦 ∣ 𝑦 = [𝐴]𝑅}) = {𝑦 ∣ 𝑦 = [𝐴]𝑅}
20	17, 19	eqtrdi 2811	. . . 4 ⊢ (𝐴 ∈ dom 𝑅 → ({𝑦 ∣ 𝐴 ∈ dom 𝑅} ∩ {𝑦 ∣ 𝑦 = [𝐴]𝑅}) = {𝑦 ∣ 𝑦 = [𝐴]𝑅})
21	13, 20	eqtrd 2795	. . 3 ⊢ (𝐴 ∈ dom 𝑅 → {𝑦 ∣ 𝐴 QMap 𝑅𝑦} = {𝑦 ∣ 𝑦 = [𝐴]𝑅})
22		df-sn 4584	. . 3 ⊢ {[𝐴]𝑅} = {𝑦 ∣ 𝑦 = [𝐴]𝑅}
23	21, 22	eqtr4di 2813	. 2 ⊢ (𝐴 ∈ dom 𝑅 → {𝑦 ∣ 𝐴 QMap 𝑅𝑦} = {[𝐴]𝑅})
24	1, 23	eqtrd 2795	1 ⊢ (𝐴 ∈ dom 𝑅 → [𝐴] QMap 𝑅 = {[𝐴]𝑅})

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570   ∈ wcel 2145  {cab 2738  Vcvv 3450   ∩ cin 3897  {csn 4583   class class class wbr 5102  dom cdm 5647  [cec 8693   QMap cqmap 39027

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-11 2194  ax-ext 2732  ax-sep 5248  ax-pr 5390

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-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-br 5103  df-opab 5167  df-mpt 5186  df-xp 5653  df-cnv 5655  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-ec 8697  df-qmap 39298

This theorem is used by:  ecqmap2  39302  qmapeldisjsim  39712