Theorem prter1 39673

Description: Every partition generates an equivalence relation. (Contributed by Rodolfo Medina, 13-Oct-2010.) (Revised by Mario Carneiro, 12-Aug-2015.)

Hypothesis

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

Assertion

Ref	Expression
prter1	⊢ (Prt 𝐴 → ∼ Er ∪ 𝐴)

Distinct variable group:   𝑥,𝑢,𝑦,𝐴

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

Proof of Theorem prter1

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

Step	Hyp	Ref	Expression
1		prtlem18.1	. . . 4 ⊢ ∼ = {⟨𝑥, 𝑦⟩ ∣ ∃𝑢 ∈ 𝐴 (𝑥 ∈ 𝑢 ∧ 𝑦 ∈ 𝑢)}
2	1	relopabiv 5807	. . 3 ⊢ Rel ∼
3	2	a1i 11	. 2 ⊢ (Prt 𝐴 → Rel ∼ )
4	1	prtlem16 39663	. . 3 ⊢ dom ∼ = ∪ 𝐴
5	4	a1i 11	. 2 ⊢ (Prt 𝐴 → dom ∼ = ∪ 𝐴)
6		prtlem15 39669	. . . . . 6 ⊢ (Prt 𝐴 → (∃𝑣 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ((𝑧 ∈ 𝑣 ∧ 𝑤 ∈ 𝑣) ∧ (𝑤 ∈ 𝑞 ∧ 𝑝 ∈ 𝑞)) → ∃𝑟 ∈ 𝐴 (𝑧 ∈ 𝑟 ∧ 𝑝 ∈ 𝑟)))
7	1	prtlem13 39662	. . . . . . . 8 ⊢ (𝑧 ∼ 𝑤 ↔ ∃𝑣 ∈ 𝐴 (𝑧 ∈ 𝑣 ∧ 𝑤 ∈ 𝑣))
8	1	prtlem13 39662	. . . . . . . 8 ⊢ (𝑤 ∼ 𝑝 ↔ ∃𝑞 ∈ 𝐴 (𝑤 ∈ 𝑞 ∧ 𝑝 ∈ 𝑞))
9	7, 8	anbi12i 639	. . . . . . 7 ⊢ ((𝑧 ∼ 𝑤 ∧ 𝑤 ∼ 𝑝) ↔ (∃𝑣 ∈ 𝐴 (𝑧 ∈ 𝑣 ∧ 𝑤 ∈ 𝑣) ∧ ∃𝑞 ∈ 𝐴 (𝑤 ∈ 𝑞 ∧ 𝑝 ∈ 𝑞)))
10		reeanv 3237	. . . . . . 7 ⊢ (∃𝑣 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ((𝑧 ∈ 𝑣 ∧ 𝑤 ∈ 𝑣) ∧ (𝑤 ∈ 𝑞 ∧ 𝑝 ∈ 𝑞)) ↔ (∃𝑣 ∈ 𝐴 (𝑧 ∈ 𝑣 ∧ 𝑤 ∈ 𝑣) ∧ ∃𝑞 ∈ 𝐴 (𝑤 ∈ 𝑞 ∧ 𝑝 ∈ 𝑞)))
11	9, 10	bitr4i 281	. . . . . 6 ⊢ ((𝑧 ∼ 𝑤 ∧ 𝑤 ∼ 𝑝) ↔ ∃𝑣 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ((𝑧 ∈ 𝑣 ∧ 𝑤 ∈ 𝑣) ∧ (𝑤 ∈ 𝑞 ∧ 𝑝 ∈ 𝑞)))
12	1	prtlem13 39662	. . . . . 6 ⊢ (𝑧 ∼ 𝑝 ↔ ∃𝑟 ∈ 𝐴 (𝑧 ∈ 𝑟 ∧ 𝑝 ∈ 𝑟))
13	6, 11, 12	3imtr4g 299	. . . . 5 ⊢ (Prt 𝐴 → ((𝑧 ∼ 𝑤 ∧ 𝑤 ∼ 𝑝) → 𝑧 ∼ 𝑝))
14		pm3.22 464	. . . . . . 7 ⊢ ((𝑧 ∈ 𝑣 ∧ 𝑤 ∈ 𝑣) → (𝑤 ∈ 𝑣 ∧ 𝑧 ∈ 𝑣))
15	14	reximi 3103	. . . . . 6 ⊢ (∃𝑣 ∈ 𝐴 (𝑧 ∈ 𝑣 ∧ 𝑤 ∈ 𝑣) → ∃𝑣 ∈ 𝐴 (𝑤 ∈ 𝑣 ∧ 𝑧 ∈ 𝑣))
16	1	prtlem13 39662	. . . . . 6 ⊢ (𝑤 ∼ 𝑧 ↔ ∃𝑣 ∈ 𝐴 (𝑤 ∈ 𝑣 ∧ 𝑧 ∈ 𝑣))
17	15, 7, 16	3imtr4i 295	. . . . 5 ⊢ (𝑧 ∼ 𝑤 → 𝑤 ∼ 𝑧)
18	13, 17	jctil 528	. . . 4 ⊢ (Prt 𝐴 → ((𝑧 ∼ 𝑤 → 𝑤 ∼ 𝑧) ∧ ((𝑧 ∼ 𝑤 ∧ 𝑤 ∼ 𝑝) → 𝑧 ∼ 𝑝)))
19	18	alrimivv 1958	. . 3 ⊢ (Prt 𝐴 → ∀𝑤∀𝑝((𝑧 ∼ 𝑤 → 𝑤 ∼ 𝑧) ∧ ((𝑧 ∼ 𝑤 ∧ 𝑤 ∼ 𝑝) → 𝑧 ∼ 𝑝)))
20	19	alrimiv 1957	. 2 ⊢ (Prt 𝐴 → ∀𝑧∀𝑤∀𝑝((𝑧 ∼ 𝑤 → 𝑤 ∼ 𝑧) ∧ ((𝑧 ∼ 𝑤 ∧ 𝑤 ∼ 𝑝) → 𝑧 ∼ 𝑝)))
21		dfer2 8691	. 2 ⊢ ( ∼ Er ∪ 𝐴 ↔ (Rel ∼ ∧ dom ∼ = ∪ 𝐴 ∧ ∀𝑧∀𝑤∀𝑝((𝑧 ∼ 𝑤 → 𝑤 ∼ 𝑧) ∧ ((𝑧 ∼ 𝑤 ∧ 𝑤 ∼ 𝑝) → 𝑧 ∼ 𝑝))))
22	3, 5, 20, 21	syl3anbrc 1362	1 ⊢ (Prt 𝐴 → ∼ Er ∪ 𝐴)

Syntax hints:   → wi 4   ∧ wa 400  ∀wal 1568   = wceq 1570  ∃wrex 3089  ∪ cuni 4872   class class class wbr 5109  {copab 5173  dom cdm 5661  Rel wrel 5666   Er wer 8687  Prt wprt 39665

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-pr 5404

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-er 8690  df-prt 39666

This theorem is referenced by:  prtex  39674