Theorem prter1 39325

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 5776	. . 3 ⊢ Rel ∼
3	2	a1i 11	. 2 ⊢ (Prt 𝐴 → Rel ∼ )
4	1	prtlem16 39315	. . 3 ⊢ dom ∼ = ∪ 𝐴
5	4	a1i 11	. 2 ⊢ (Prt 𝐴 → dom ∼ = ∪ 𝐴)
6		prtlem15 39321	. . . . . 6 ⊢ (Prt 𝐴 → (∃𝑣 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ((𝑧 ∈ 𝑣 ∧ 𝑤 ∈ 𝑣) ∧ (𝑤 ∈ 𝑞 ∧ 𝑝 ∈ 𝑞)) → ∃𝑟 ∈ 𝐴 (𝑧 ∈ 𝑟 ∧ 𝑝 ∈ 𝑟)))
7	1	prtlem13 39314	. . . . . . . 8 ⊢ (𝑧 ∼ 𝑤 ↔ ∃𝑣 ∈ 𝐴 (𝑧 ∈ 𝑣 ∧ 𝑤 ∈ 𝑣))
8	1	prtlem13 39314	. . . . . . . 8 ⊢ (𝑤 ∼ 𝑝 ↔ ∃𝑞 ∈ 𝐴 (𝑤 ∈ 𝑞 ∧ 𝑝 ∈ 𝑞))
9	7, 8	anbi12i 629	. . . . . . 7 ⊢ ((𝑧 ∼ 𝑤 ∧ 𝑤 ∼ 𝑝) ↔ (∃𝑣 ∈ 𝐴 (𝑧 ∈ 𝑣 ∧ 𝑤 ∈ 𝑣) ∧ ∃𝑞 ∈ 𝐴 (𝑤 ∈ 𝑞 ∧ 𝑝 ∈ 𝑞)))
10		reeanv 3209	. . . . . . 7 ⊢ (∃𝑣 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ((𝑧 ∈ 𝑣 ∧ 𝑤 ∈ 𝑣) ∧ (𝑤 ∈ 𝑞 ∧ 𝑝 ∈ 𝑞)) ↔ (∃𝑣 ∈ 𝐴 (𝑧 ∈ 𝑣 ∧ 𝑤 ∈ 𝑣) ∧ ∃𝑞 ∈ 𝐴 (𝑤 ∈ 𝑞 ∧ 𝑝 ∈ 𝑞)))
11	9, 10	bitr4i 278	. . . . . 6 ⊢ ((𝑧 ∼ 𝑤 ∧ 𝑤 ∼ 𝑝) ↔ ∃𝑣 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ((𝑧 ∈ 𝑣 ∧ 𝑤 ∈ 𝑣) ∧ (𝑤 ∈ 𝑞 ∧ 𝑝 ∈ 𝑞)))
12	1	prtlem13 39314	. . . . . 6 ⊢ (𝑧 ∼ 𝑝 ↔ ∃𝑟 ∈ 𝐴 (𝑧 ∈ 𝑟 ∧ 𝑝 ∈ 𝑟))
13	6, 11, 12	3imtr4g 296	. . . . 5 ⊢ (Prt 𝐴 → ((𝑧 ∼ 𝑤 ∧ 𝑤 ∼ 𝑝) → 𝑧 ∼ 𝑝))
14		pm3.22 459	. . . . . . 7 ⊢ ((𝑧 ∈ 𝑣 ∧ 𝑤 ∈ 𝑣) → (𝑤 ∈ 𝑣 ∧ 𝑧 ∈ 𝑣))
15	14	reximi 3075	. . . . . 6 ⊢ (∃𝑣 ∈ 𝐴 (𝑧 ∈ 𝑣 ∧ 𝑤 ∈ 𝑣) → ∃𝑣 ∈ 𝐴 (𝑤 ∈ 𝑣 ∧ 𝑧 ∈ 𝑣))
16	1	prtlem13 39314	. . . . . 6 ⊢ (𝑤 ∼ 𝑧 ↔ ∃𝑣 ∈ 𝐴 (𝑤 ∈ 𝑣 ∧ 𝑧 ∈ 𝑣))
17	15, 7, 16	3imtr4i 292	. . . . 5 ⊢ (𝑧 ∼ 𝑤 → 𝑤 ∼ 𝑧)
18	13, 17	jctil 519	. . . 4 ⊢ (Prt 𝐴 → ((𝑧 ∼ 𝑤 → 𝑤 ∼ 𝑧) ∧ ((𝑧 ∼ 𝑤 ∧ 𝑤 ∼ 𝑝) → 𝑧 ∼ 𝑝)))
19	18	alrimivv 1930	. . 3 ⊢ (Prt 𝐴 → ∀𝑤∀𝑝((𝑧 ∼ 𝑤 → 𝑤 ∼ 𝑧) ∧ ((𝑧 ∼ 𝑤 ∧ 𝑤 ∼ 𝑝) → 𝑧 ∼ 𝑝)))
20	19	alrimiv 1929	. 2 ⊢ (Prt 𝐴 → ∀𝑧∀𝑤∀𝑝((𝑧 ∼ 𝑤 → 𝑤 ∼ 𝑧) ∧ ((𝑧 ∼ 𝑤 ∧ 𝑤 ∼ 𝑝) → 𝑧 ∼ 𝑝)))
21		dfer2 8644	. 2 ⊢ ( ∼ Er ∪ 𝐴 ↔ (Rel ∼ ∧ dom ∼ = ∪ 𝐴 ∧ ∀𝑧∀𝑤∀𝑝((𝑧 ∼ 𝑤 → 𝑤 ∼ 𝑧) ∧ ((𝑧 ∼ 𝑤 ∧ 𝑤 ∼ 𝑝) → 𝑧 ∼ 𝑝))))
22	3, 5, 20, 21	syl3anbrc 1345	1 ⊢ (Prt 𝐴 → ∼ Er ∪ 𝐴)

Syntax hints:   → wi 4   ∧ wa 395  ∀wal 1540   = wceq 1542  ∃wrex 3061  ∪ cuni 4850   class class class wbr 5085  {copab 5147  dom cdm 5631  Rel wrel 5636   Er wer 8640  Prt wprt 39317

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-pr 5375

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2715  df-cleq 2728  df-clel 2811  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-er 8643  df-prt 39318

This theorem is referenced by:  prtex  39326