Theorem prter2 38837

Description: The quotient set of the equivalence relation generated by a partition equals the partition itself. (Contributed by Rodolfo Medina, 17-Oct-2010.)

Hypothesis

Ref	Expression
prtlem18.1	⊢ ∼ = {⟨𝑥, 𝑦⟩ ∣ ∃𝑢 ∈ 𝐴 (𝑥 ∈ 𝑢 ∧ 𝑦 ∈ 𝑢)}

Assertion

Ref	Expression
prter2	⊢ (Prt 𝐴 → (∪ 𝐴 / ∼ ) = (𝐴 ∖ {∅}))

Distinct variable group:   𝑥,𝑢,𝑦,𝐴

Allowed substitution hints:   ∼ (𝑥,𝑦,𝑢)

Proof of Theorem prter2

Dummy variables 𝑝 𝑣 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		rexcom4 3294	. . . . . . . . . . 11 ⊢ (∃𝑣 ∈ 𝐴 ∃𝑧(𝑧 ∈ 𝑣 ∧ 𝑝 = [𝑧] ∼ ) ↔ ∃𝑧∃𝑣 ∈ 𝐴 (𝑧 ∈ 𝑣 ∧ 𝑝 = [𝑧] ∼ ))
2		r19.41v 3195	. . . . . . . . . . . 12 ⊢ (∃𝑣 ∈ 𝐴 (𝑧 ∈ 𝑣 ∧ 𝑝 = [𝑧] ∼ ) ↔ (∃𝑣 ∈ 𝐴 𝑧 ∈ 𝑣 ∧ 𝑝 = [𝑧] ∼ ))
3	2	exbii 1846	. . . . . . . . . . 11 ⊢ (∃𝑧∃𝑣 ∈ 𝐴 (𝑧 ∈ 𝑣 ∧ 𝑝 = [𝑧] ∼ ) ↔ ∃𝑧(∃𝑣 ∈ 𝐴 𝑧 ∈ 𝑣 ∧ 𝑝 = [𝑧] ∼ ))
4	1, 3	bitri 275	. . . . . . . . . 10 ⊢ (∃𝑣 ∈ 𝐴 ∃𝑧(𝑧 ∈ 𝑣 ∧ 𝑝 = [𝑧] ∼ ) ↔ ∃𝑧(∃𝑣 ∈ 𝐴 𝑧 ∈ 𝑣 ∧ 𝑝 = [𝑧] ∼ ))
5		df-rex 3077	. . . . . . . . . . 11 ⊢ (∃𝑧 ∈ 𝑣 𝑝 = [𝑧] ∼ ↔ ∃𝑧(𝑧 ∈ 𝑣 ∧ 𝑝 = [𝑧] ∼ ))
6	5	rexbii 3100	. . . . . . . . . 10 ⊢ (∃𝑣 ∈ 𝐴 ∃𝑧 ∈ 𝑣 𝑝 = [𝑧] ∼ ↔ ∃𝑣 ∈ 𝐴 ∃𝑧(𝑧 ∈ 𝑣 ∧ 𝑝 = [𝑧] ∼ ))
7		vex 3492	. . . . . . . . . . . 12 ⊢ 𝑝 ∈ V
8	7	elqs 8827	. . . . . . . . . . 11 ⊢ (𝑝 ∈ (∪ 𝐴 / ∼ ) ↔ ∃𝑧 ∈ ∪ 𝐴𝑝 = [𝑧] ∼ )
9		df-rex 3077	. . . . . . . . . . . 12 ⊢ (∃𝑧 ∈ ∪ 𝐴𝑝 = [𝑧] ∼ ↔ ∃𝑧(𝑧 ∈ ∪ 𝐴 ∧ 𝑝 = [𝑧] ∼ ))
10		eluni2 4935	. . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ ∪ 𝐴 ↔ ∃𝑣 ∈ 𝐴 𝑧 ∈ 𝑣)
11	10	anbi1i 623	. . . . . . . . . . . . 13 ⊢ ((𝑧 ∈ ∪ 𝐴 ∧ 𝑝 = [𝑧] ∼ ) ↔ (∃𝑣 ∈ 𝐴 𝑧 ∈ 𝑣 ∧ 𝑝 = [𝑧] ∼ ))
12	11	exbii 1846	. . . . . . . . . . . 12 ⊢ (∃𝑧(𝑧 ∈ ∪ 𝐴 ∧ 𝑝 = [𝑧] ∼ ) ↔ ∃𝑧(∃𝑣 ∈ 𝐴 𝑧 ∈ 𝑣 ∧ 𝑝 = [𝑧] ∼ ))
13	9, 12	bitri 275	. . . . . . . . . . 11 ⊢ (∃𝑧 ∈ ∪ 𝐴𝑝 = [𝑧] ∼ ↔ ∃𝑧(∃𝑣 ∈ 𝐴 𝑧 ∈ 𝑣 ∧ 𝑝 = [𝑧] ∼ ))
14	8, 13	bitri 275	. . . . . . . . . 10 ⊢ (𝑝 ∈ (∪ 𝐴 / ∼ ) ↔ ∃𝑧(∃𝑣 ∈ 𝐴 𝑧 ∈ 𝑣 ∧ 𝑝 = [𝑧] ∼ ))
15	4, 6, 14	3bitr4ri 304	. . . . . . . . 9 ⊢ (𝑝 ∈ (∪ 𝐴 / ∼ ) ↔ ∃𝑣 ∈ 𝐴 ∃𝑧 ∈ 𝑣 𝑝 = [𝑧] ∼ )
16		prtlem18.1	. . . . . . . . . . . 12 ⊢ ∼ = {⟨𝑥, 𝑦⟩ ∣ ∃𝑢 ∈ 𝐴 (𝑥 ∈ 𝑢 ∧ 𝑦 ∈ 𝑢)}
17	16	prtlem19 38834	. . . . . . . . . . 11 ⊢ (Prt 𝐴 → ((𝑣 ∈ 𝐴 ∧ 𝑧 ∈ 𝑣) → 𝑣 = [𝑧] ∼ ))
18	17	ralrimivv 3206	. . . . . . . . . 10 ⊢ (Prt 𝐴 → ∀𝑣 ∈ 𝐴 ∀𝑧 ∈ 𝑣 𝑣 = [𝑧] ∼ )
19		2r19.29 3145	. . . . . . . . . . 11 ⊢ ((∀𝑣 ∈ 𝐴 ∀𝑧 ∈ 𝑣 𝑣 = [𝑧] ∼ ∧ ∃𝑣 ∈ 𝐴 ∃𝑧 ∈ 𝑣 𝑝 = [𝑧] ∼ ) → ∃𝑣 ∈ 𝐴 ∃𝑧 ∈ 𝑣 (𝑣 = [𝑧] ∼ ∧ 𝑝 = [𝑧] ∼ ))
20	19	ex 412	. . . . . . . . . 10 ⊢ (∀𝑣 ∈ 𝐴 ∀𝑧 ∈ 𝑣 𝑣 = [𝑧] ∼ → (∃𝑣 ∈ 𝐴 ∃𝑧 ∈ 𝑣 𝑝 = [𝑧] ∼ → ∃𝑣 ∈ 𝐴 ∃𝑧 ∈ 𝑣 (𝑣 = [𝑧] ∼ ∧ 𝑝 = [𝑧] ∼ )))
21	18, 20	syl 17	. . . . . . . . 9 ⊢ (Prt 𝐴 → (∃𝑣 ∈ 𝐴 ∃𝑧 ∈ 𝑣 𝑝 = [𝑧] ∼ → ∃𝑣 ∈ 𝐴 ∃𝑧 ∈ 𝑣 (𝑣 = [𝑧] ∼ ∧ 𝑝 = [𝑧] ∼ )))
22	15, 21	biimtrid 242	. . . . . . . 8 ⊢ (Prt 𝐴 → (𝑝 ∈ (∪ 𝐴 / ∼ ) → ∃𝑣 ∈ 𝐴 ∃𝑧 ∈ 𝑣 (𝑣 = [𝑧] ∼ ∧ 𝑝 = [𝑧] ∼ )))
23		eqtr3 2766	. . . . . . . . . 10 ⊢ ((𝑣 = [𝑧] ∼ ∧ 𝑝 = [𝑧] ∼ ) → 𝑣 = 𝑝)
24	23	reximi 3090	. . . . . . . . 9 ⊢ (∃𝑧 ∈ 𝑣 (𝑣 = [𝑧] ∼ ∧ 𝑝 = [𝑧] ∼ ) → ∃𝑧 ∈ 𝑣 𝑣 = 𝑝)
25	24	reximi 3090	. . . . . . . 8 ⊢ (∃𝑣 ∈ 𝐴 ∃𝑧 ∈ 𝑣 (𝑣 = [𝑧] ∼ ∧ 𝑝 = [𝑧] ∼ ) → ∃𝑣 ∈ 𝐴 ∃𝑧 ∈ 𝑣 𝑣 = 𝑝)
26	22, 25	syl6 35	. . . . . . 7 ⊢ (Prt 𝐴 → (𝑝 ∈ (∪ 𝐴 / ∼ ) → ∃𝑣 ∈ 𝐴 ∃𝑧 ∈ 𝑣 𝑣 = 𝑝))
27		df-rex 3077	. . . . . . . . . 10 ⊢ (∃𝑧 ∈ 𝑣 𝑣 = 𝑝 ↔ ∃𝑧(𝑧 ∈ 𝑣 ∧ 𝑣 = 𝑝))
28		19.41v 1949	. . . . . . . . . 10 ⊢ (∃𝑧(𝑧 ∈ 𝑣 ∧ 𝑣 = 𝑝) ↔ (∃𝑧 𝑧 ∈ 𝑣 ∧ 𝑣 = 𝑝))
29	27, 28	bitri 275	. . . . . . . . 9 ⊢ (∃𝑧 ∈ 𝑣 𝑣 = 𝑝 ↔ (∃𝑧 𝑧 ∈ 𝑣 ∧ 𝑣 = 𝑝))
30	29	simprbi 496	. . . . . . . 8 ⊢ (∃𝑧 ∈ 𝑣 𝑣 = 𝑝 → 𝑣 = 𝑝)
31	30	reximi 3090	. . . . . . 7 ⊢ (∃𝑣 ∈ 𝐴 ∃𝑧 ∈ 𝑣 𝑣 = 𝑝 → ∃𝑣 ∈ 𝐴 𝑣 = 𝑝)
32	26, 31	syl6 35	. . . . . 6 ⊢ (Prt 𝐴 → (𝑝 ∈ (∪ 𝐴 / ∼ ) → ∃𝑣 ∈ 𝐴 𝑣 = 𝑝))
33		risset 3239	. . . . . 6 ⊢ (𝑝 ∈ 𝐴 ↔ ∃𝑣 ∈ 𝐴 𝑣 = 𝑝)
34	32, 33	imbitrrdi 252	. . . . 5 ⊢ (Prt 𝐴 → (𝑝 ∈ (∪ 𝐴 / ∼ ) → 𝑝 ∈ 𝐴))
35	16	prtlem400 38826	. . . . . 6 ⊢ ¬ ∅ ∈ (∪ 𝐴 / ∼ )
36		nelelne 3047	. . . . . 6 ⊢ (¬ ∅ ∈ (∪ 𝐴 / ∼ ) → (𝑝 ∈ (∪ 𝐴 / ∼ ) → 𝑝 ≠ ∅))
37	35, 36	mp1i 13	. . . . 5 ⊢ (Prt 𝐴 → (𝑝 ∈ (∪ 𝐴 / ∼ ) → 𝑝 ≠ ∅))
38	34, 37	jcad 512	. . . 4 ⊢ (Prt 𝐴 → (𝑝 ∈ (∪ 𝐴 / ∼ ) → (𝑝 ∈ 𝐴 ∧ 𝑝 ≠ ∅)))
39		eldifsn 4811	. . . 4 ⊢ (𝑝 ∈ (𝐴 ∖ {∅}) ↔ (𝑝 ∈ 𝐴 ∧ 𝑝 ≠ ∅))
40	38, 39	imbitrrdi 252	. . 3 ⊢ (Prt 𝐴 → (𝑝 ∈ (∪ 𝐴 / ∼ ) → 𝑝 ∈ (𝐴 ∖ {∅})))
41		neldifsn 4817	. . . . . . 7 ⊢ ¬ ∅ ∈ (𝐴 ∖ {∅})
42		n0el 4387	. . . . . . 7 ⊢ (¬ ∅ ∈ (𝐴 ∖ {∅}) ↔ ∀𝑝 ∈ (𝐴 ∖ {∅})∃𝑧 𝑧 ∈ 𝑝)
43	41, 42	mpbi 230	. . . . . 6 ⊢ ∀𝑝 ∈ (𝐴 ∖ {∅})∃𝑧 𝑧 ∈ 𝑝
44	43	rspec 3256	. . . . 5 ⊢ (𝑝 ∈ (𝐴 ∖ {∅}) → ∃𝑧 𝑧 ∈ 𝑝)
45		eldifi 4154	. . . . 5 ⊢ (𝑝 ∈ (𝐴 ∖ {∅}) → 𝑝 ∈ 𝐴)
46	44, 45	jca 511	. . . 4 ⊢ (𝑝 ∈ (𝐴 ∖ {∅}) → (∃𝑧 𝑧 ∈ 𝑝 ∧ 𝑝 ∈ 𝐴))
47	16	prtlem19 38834	. . . . . . . . 9 ⊢ (Prt 𝐴 → ((𝑝 ∈ 𝐴 ∧ 𝑧 ∈ 𝑝) → 𝑝 = [𝑧] ∼ ))
48	47	ancomsd 465	. . . . . . . 8 ⊢ (Prt 𝐴 → ((𝑧 ∈ 𝑝 ∧ 𝑝 ∈ 𝐴) → 𝑝 = [𝑧] ∼ ))
49		elunii 4936	. . . . . . . 8 ⊢ ((𝑧 ∈ 𝑝 ∧ 𝑝 ∈ 𝐴) → 𝑧 ∈ ∪ 𝐴)
50	48, 49	jca2r 38811	. . . . . . 7 ⊢ (Prt 𝐴 → ((𝑧 ∈ 𝑝 ∧ 𝑝 ∈ 𝐴) → (𝑧 ∈ ∪ 𝐴 ∧ 𝑝 = [𝑧] ∼ )))
51		prtlem11 38822	. . . . . . . . 9 ⊢ (𝑝 ∈ V → (𝑧 ∈ ∪ 𝐴 → (𝑝 = [𝑧] ∼ → 𝑝 ∈ (∪ 𝐴 / ∼ ))))
52	51	elv 3493	. . . . . . . 8 ⊢ (𝑧 ∈ ∪ 𝐴 → (𝑝 = [𝑧] ∼ → 𝑝 ∈ (∪ 𝐴 / ∼ )))
53	52	imp 406	. . . . . . 7 ⊢ ((𝑧 ∈ ∪ 𝐴 ∧ 𝑝 = [𝑧] ∼ ) → 𝑝 ∈ (∪ 𝐴 / ∼ ))
54	50, 53	syl6 35	. . . . . 6 ⊢ (Prt 𝐴 → ((𝑧 ∈ 𝑝 ∧ 𝑝 ∈ 𝐴) → 𝑝 ∈ (∪ 𝐴 / ∼ )))
55	54	eximdv 1916	. . . . 5 ⊢ (Prt 𝐴 → (∃𝑧(𝑧 ∈ 𝑝 ∧ 𝑝 ∈ 𝐴) → ∃𝑧 𝑝 ∈ (∪ 𝐴 / ∼ )))
56		19.41v 1949	. . . . 5 ⊢ (∃𝑧(𝑧 ∈ 𝑝 ∧ 𝑝 ∈ 𝐴) ↔ (∃𝑧 𝑧 ∈ 𝑝 ∧ 𝑝 ∈ 𝐴))
57		19.9v 1983	. . . . 5 ⊢ (∃𝑧 𝑝 ∈ (∪ 𝐴 / ∼ ) ↔ 𝑝 ∈ (∪ 𝐴 / ∼ ))
58	55, 56, 57	3imtr3g 295	. . . 4 ⊢ (Prt 𝐴 → ((∃𝑧 𝑧 ∈ 𝑝 ∧ 𝑝 ∈ 𝐴) → 𝑝 ∈ (∪ 𝐴 / ∼ )))
59	46, 58	syl5 34	. . 3 ⊢ (Prt 𝐴 → (𝑝 ∈ (𝐴 ∖ {∅}) → 𝑝 ∈ (∪ 𝐴 / ∼ )))
60	40, 59	impbid 212	. 2 ⊢ (Prt 𝐴 → (𝑝 ∈ (∪ 𝐴 / ∼ ) ↔ 𝑝 ∈ (𝐴 ∖ {∅})))
61	60	eqrdv 2738	1 ⊢ (Prt 𝐴 → (∪ 𝐴 / ∼ ) = (𝐴 ∖ {∅}))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1537  ∃wex 1777   ∈ wcel 2108   ≠ wne 2946  ∀wral 3067  ∃wrex 3076  Vcvv 3488   ∖ cdif 3973  ∅c0 4352  {csn 4648  ∪ cuni 4931  {copab 5228  [cec 8761   / cqs 8762  Prt wprt 38827

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-xp 5706  df-cnv 5708  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-ec 8765  df-qs 8769  df-prt 38828

This theorem is referenced by: (None)