Theorem qsss 6868

Description: A quotient set is a set of subsets of the base set. (Contributed by Mario Carneiro, 9-Jul-2014.) (Revised by Mario Carneiro, 12-Aug-2015.)

Hypothesis

Ref	Expression
qsss.1	⊢ (𝜑 → 𝑅 Er 𝐴)

Assertion

Ref	Expression
qsss	⊢ (𝜑 → (𝐴 / 𝑅) ⊆ 𝒫 𝐴)

Proof of Theorem qsss

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

Step	Hyp	Ref	Expression
1		vex 2824	. . . 4 ⊢ 𝑥 ∈ V
2	1	elqs 6860	. . 3 ⊢ (𝑥 ∈ (𝐴 / 𝑅) ↔ ∃𝑦 ∈ 𝐴 𝑥 = [𝑦]𝑅)
3		qsss.1	. . . . . . 7 ⊢ (𝜑 → 𝑅 Er 𝐴)
4	3	ecss 6850	. . . . . 6 ⊢ (𝜑 → [𝑦]𝑅 ⊆ 𝐴)
5		sseq1 3271	. . . . . 6 ⊢ (𝑥 = [𝑦]𝑅 → (𝑥 ⊆ 𝐴 ↔ [𝑦]𝑅 ⊆ 𝐴))
6	4, 5	syl5ibrcom 157	. . . . 5 ⊢ (𝜑 → (𝑥 = [𝑦]𝑅 → 𝑥 ⊆ 𝐴))
7		velpw 3695	. . . . 5 ⊢ (𝑥 ∈ 𝒫 𝐴 ↔ 𝑥 ⊆ 𝐴)
8	6, 7	imbitrrdi 162	. . . 4 ⊢ (𝜑 → (𝑥 = [𝑦]𝑅 → 𝑥 ∈ 𝒫 𝐴))
9	8	rexlimdvw 2672	. . 3 ⊢ (𝜑 → (∃𝑦 ∈ 𝐴 𝑥 = [𝑦]𝑅 → 𝑥 ∈ 𝒫 𝐴))
10	2, 9	biimtrid 152	. 2 ⊢ (𝜑 → (𝑥 ∈ (𝐴 / 𝑅) → 𝑥 ∈ 𝒫 𝐴))
11	10	ssrdv 3254	1 ⊢ (𝜑 → (𝐴 / 𝑅) ⊆ 𝒫 𝐴)

This proof depends on syntax axioms:   → wi 4   = wceq 1402   ∈ wcel 2209  ∃wrex 2529   ⊆ wss 3220  𝒫 cpw 3688   Er wer 6804  [cec 6805   / cqs 6806

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-br 4131  df-opab 4193  df-xp 4780  df-rel 4781  df-cnv 4782  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-er 6807  df-ec 6809  df-qs 6813

This theorem is used by:  axcnex  8226