Theorem qsinxp 6847

Description: Restrict the equivalence relation in a quotient set to the base set. (Contributed by Mario Carneiro, 23-Feb-2015.)

Assertion

Ref	Expression
qsinxp	⊢ ((𝑅 “ 𝐴) ⊆ 𝐴 → (𝐴 / 𝑅) = (𝐴 / (𝑅 ∩ (𝐴 × 𝐴))))

Proof of Theorem qsinxp

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ecinxp 6846	. . . . 5 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝑥 ∈ 𝐴) → [𝑥]𝑅 = [𝑥](𝑅 ∩ (𝐴 × 𝐴)))
2	1	eqeq2d 2246	. . . 4 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑦 = [𝑥]𝑅 ↔ 𝑦 = [𝑥](𝑅 ∩ (𝐴 × 𝐴))))
3	2	rexbidva 2541	. . 3 ⊢ ((𝑅 “ 𝐴) ⊆ 𝐴 → (∃𝑥 ∈ 𝐴 𝑦 = [𝑥]𝑅 ↔ ∃𝑥 ∈ 𝐴 𝑦 = [𝑥](𝑅 ∩ (𝐴 × 𝐴))))
4	3	abbidv 2354	. 2 ⊢ ((𝑅 “ 𝐴) ⊆ 𝐴 → {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = [𝑥]𝑅} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = [𝑥](𝑅 ∩ (𝐴 × 𝐴))})
5		df-qs 6775	. 2 ⊢ (𝐴 / 𝑅) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = [𝑥]𝑅}
6		df-qs 6775	. 2 ⊢ (𝐴 / (𝑅 ∩ (𝐴 × 𝐴))) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = [𝑥](𝑅 ∩ (𝐴 × 𝐴))}
7	4, 5, 6	3eqtr4g 2292	1 ⊢ ((𝑅 “ 𝐴) ⊆ 𝐴 → (𝐴 / 𝑅) = (𝐴 / (𝑅 ∩ (𝐴 × 𝐴))))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1398   ∈ wcel 2205  {cab 2220  ∃wrex 2523   ∩ cin 3212   ⊆ wss 3213   × cxp 4749   “ cima 4754  [cec 6767   / cqs 6768

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2208  ax-ext 2216  ax-sep 4230  ax-pow 4289  ax-pr 4324

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-un 3217  df-in 3219  df-ss 3226  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-br 4112  df-opab 4174  df-xp 4757  df-rel 4758  df-cnv 4759  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-ec 6771  df-qs 6775

This theorem is referenced by: (None)