Theorem qsinxp 6665

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 6664	. . . . 5 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝑥 ∈ 𝐴) → [𝑥]𝑅 = [𝑥](𝑅 ∩ (𝐴 × 𝐴)))
2	1	eqeq2d 2205	. . . 4 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑦 = [𝑥]𝑅 ↔ 𝑦 = [𝑥](𝑅 ∩ (𝐴 × 𝐴))))
3	2	rexbidva 2491	. . 3 ⊢ ((𝑅 “ 𝐴) ⊆ 𝐴 → (∃𝑥 ∈ 𝐴 𝑦 = [𝑥]𝑅 ↔ ∃𝑥 ∈ 𝐴 𝑦 = [𝑥](𝑅 ∩ (𝐴 × 𝐴))))
4	3	abbidv 2311	. 2 ⊢ ((𝑅 “ 𝐴) ⊆ 𝐴 → {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = [𝑥]𝑅} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = [𝑥](𝑅 ∩ (𝐴 × 𝐴))})
5		df-qs 6593	. 2 ⊢ (𝐴 / 𝑅) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = [𝑥]𝑅}
6		df-qs 6593	. 2 ⊢ (𝐴 / (𝑅 ∩ (𝐴 × 𝐴))) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = [𝑥](𝑅 ∩ (𝐴 × 𝐴))}
7	4, 5, 6	3eqtr4g 2251	1 ⊢ ((𝑅 “ 𝐴) ⊆ 𝐴 → (𝐴 / 𝑅) = (𝐴 / (𝑅 ∩ (𝐴 × 𝐴))))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1364   ∈ wcel 2164  {cab 2179  ∃wrex 2473   ∩ cin 3152   ⊆ wss 3153   × cxp 4657   “ cima 4662  [cec 6585   / cqs 6586

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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-v 2762  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-br 4030  df-opab 4091  df-xp 4665  df-rel 4666  df-cnv 4667  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-ec 6589  df-qs 6593

This theorem is referenced by: (None)