Theorem mrcun 17577

Description: Idempotence of closure under a pair union. (Contributed by Stefan O'Rear, 31-Jan-2015.)

Hypothesis

Ref	Expression
mrcfval.f	⊢ 𝐹 = (mrCls‘𝐶)

Assertion

Ref	Expression
mrcun	⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑋 ∧ 𝑉 ⊆ 𝑋) → (𝐹‘(𝑈 ∪ 𝑉)) = (𝐹‘((𝐹‘𝑈) ∪ (𝐹‘𝑉))))

Proof of Theorem mrcun

Step	Hyp	Ref	Expression
1		simp1 1137	. . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑋 ∧ 𝑉 ⊆ 𝑋) → 𝐶 ∈ (Moore‘𝑋))
2		mre1cl 17545	. . . . . . 7 ⊢ (𝐶 ∈ (Moore‘𝑋) → 𝑋 ∈ 𝐶)
3		elpw2g 5268	. . . . . . 7 ⊢ (𝑋 ∈ 𝐶 → (𝑈 ∈ 𝒫 𝑋 ↔ 𝑈 ⊆ 𝑋))
4	2, 3	syl 17	. . . . . 6 ⊢ (𝐶 ∈ (Moore‘𝑋) → (𝑈 ∈ 𝒫 𝑋 ↔ 𝑈 ⊆ 𝑋))
5	4	biimpar 477	. . . . 5 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑋) → 𝑈 ∈ 𝒫 𝑋)
6	5	3adant3 1133	. . . 4 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑋 ∧ 𝑉 ⊆ 𝑋) → 𝑈 ∈ 𝒫 𝑋)
7		elpw2g 5268	. . . . . . 7 ⊢ (𝑋 ∈ 𝐶 → (𝑉 ∈ 𝒫 𝑋 ↔ 𝑉 ⊆ 𝑋))
8	2, 7	syl 17	. . . . . 6 ⊢ (𝐶 ∈ (Moore‘𝑋) → (𝑉 ∈ 𝒫 𝑋 ↔ 𝑉 ⊆ 𝑋))
9	8	biimpar 477	. . . . 5 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑉 ⊆ 𝑋) → 𝑉 ∈ 𝒫 𝑋)
10	9	3adant2 1132	. . . 4 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑋 ∧ 𝑉 ⊆ 𝑋) → 𝑉 ∈ 𝒫 𝑋)
11	6, 10	prssd 4766	. . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑋 ∧ 𝑉 ⊆ 𝑋) → {𝑈, 𝑉} ⊆ 𝒫 𝑋)
12		mrcfval.f	. . . 4 ⊢ 𝐹 = (mrCls‘𝐶)
13	12	mrcuni 17576	. . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ {𝑈, 𝑉} ⊆ 𝒫 𝑋) → (𝐹‘∪ {𝑈, 𝑉}) = (𝐹‘∪ (𝐹 “ {𝑈, 𝑉})))
14	1, 11, 13	syl2anc 585	. 2 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑋 ∧ 𝑉 ⊆ 𝑋) → (𝐹‘∪ {𝑈, 𝑉}) = (𝐹‘∪ (𝐹 “ {𝑈, 𝑉})))
15		uniprg 4867	. . . 4 ⊢ ((𝑈 ∈ 𝒫 𝑋 ∧ 𝑉 ∈ 𝒫 𝑋) → ∪ {𝑈, 𝑉} = (𝑈 ∪ 𝑉))
16	6, 10, 15	syl2anc 585	. . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑋 ∧ 𝑉 ⊆ 𝑋) → ∪ {𝑈, 𝑉} = (𝑈 ∪ 𝑉))
17	16	fveq2d 6836	. 2 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑋 ∧ 𝑉 ⊆ 𝑋) → (𝐹‘∪ {𝑈, 𝑉}) = (𝐹‘(𝑈 ∪ 𝑉)))
18	12	mrcf 17564	. . . . . . . 8 ⊢ (𝐶 ∈ (Moore‘𝑋) → 𝐹:𝒫 𝑋⟶𝐶)
19	18	ffnd 6661	. . . . . . 7 ⊢ (𝐶 ∈ (Moore‘𝑋) → 𝐹 Fn 𝒫 𝑋)
20	19	3ad2ant1 1134	. . . . . 6 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑋 ∧ 𝑉 ⊆ 𝑋) → 𝐹 Fn 𝒫 𝑋)
21		fnimapr 6915	. . . . . 6 ⊢ ((𝐹 Fn 𝒫 𝑋 ∧ 𝑈 ∈ 𝒫 𝑋 ∧ 𝑉 ∈ 𝒫 𝑋) → (𝐹 “ {𝑈, 𝑉}) = {(𝐹‘𝑈), (𝐹‘𝑉)})
22	20, 6, 10, 21	syl3anc 1374	. . . . 5 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑋 ∧ 𝑉 ⊆ 𝑋) → (𝐹 “ {𝑈, 𝑉}) = {(𝐹‘𝑈), (𝐹‘𝑉)})
23	22	unieqd 4864	. . . 4 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑋 ∧ 𝑉 ⊆ 𝑋) → ∪ (𝐹 “ {𝑈, 𝑉}) = ∪ {(𝐹‘𝑈), (𝐹‘𝑉)})
24		fvex 6845	. . . . 5 ⊢ (𝐹‘𝑈) ∈ V
25		fvex 6845	. . . . 5 ⊢ (𝐹‘𝑉) ∈ V
26	24, 25	unipr 4868	. . . 4 ⊢ ∪ {(𝐹‘𝑈), (𝐹‘𝑉)} = ((𝐹‘𝑈) ∪ (𝐹‘𝑉))
27	23, 26	eqtrdi 2788	. . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑋 ∧ 𝑉 ⊆ 𝑋) → ∪ (𝐹 “ {𝑈, 𝑉}) = ((𝐹‘𝑈) ∪ (𝐹‘𝑉)))
28	27	fveq2d 6836	. 2 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑋 ∧ 𝑉 ⊆ 𝑋) → (𝐹‘∪ (𝐹 “ {𝑈, 𝑉})) = (𝐹‘((𝐹‘𝑈) ∪ (𝐹‘𝑉))))
29	14, 17, 28	3eqtr3d 2780	1 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑋 ∧ 𝑉 ⊆ 𝑋) → (𝐹‘(𝑈 ∪ 𝑉)) = (𝐹‘((𝐹‘𝑈) ∪ (𝐹‘𝑉))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114   ∪ cun 3888   ⊆ wss 3890  𝒫 cpw 4542  {cpr 4570  ∪ cuni 4851   “ cima 5625   Fn wfn 6485  ‘cfv 6490  Moorecmre 17533  mrClscmrc 17534

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-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5231  ax-nul 5241  ax-pow 5300  ax-pr 5368  ax-un 7680

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-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-int 4891  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-fv 6498  df-mre 17537  df-mrc 17538

This theorem is referenced by: (None)