Theorem mreunirn 17751

Description: Two ways to express the notion of being a Moore collection on an unspecified base. (Contributed by Stefan O'Rear, 30-Jan-2015.)

Assertion

Ref	Expression
mreunirn	⊢ (𝐶 ∈ ∪ ran Moore ↔ 𝐶 ∈ (Moore‘∪ 𝐶))

Proof of Theorem mreunirn

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fnmre 17741	. . . 4 ⊢ Moore Fn V
2		fnunirn 7249	. . . 4 ⊢ (Moore Fn V → (𝐶 ∈ ∪ ran Moore ↔ ∃𝑥 ∈ V 𝐶 ∈ (Moore‘𝑥)))
3	1, 2	ax-mp 5	. . 3 ⊢ (𝐶 ∈ ∪ ran Moore ↔ ∃𝑥 ∈ V 𝐶 ∈ (Moore‘𝑥))
4		mreuni 17750	. . . . . . 7 ⊢ (𝐶 ∈ (Moore‘𝑥) → ∪ 𝐶 = 𝑥)
5	4	fveq2d 6881	. . . . . 6 ⊢ (𝐶 ∈ (Moore‘𝑥) → (Moore‘∪ 𝐶) = (Moore‘𝑥))
6	5	eleq2d 2847	. . . . 5 ⊢ (𝐶 ∈ (Moore‘𝑥) → (𝐶 ∈ (Moore‘∪ 𝐶) ↔ 𝐶 ∈ (Moore‘𝑥)))
7	6	ibir 271	. . . 4 ⊢ (𝐶 ∈ (Moore‘𝑥) → 𝐶 ∈ (Moore‘∪ 𝐶))
8	7	rexlimivw 3160	. . 3 ⊢ (∃𝑥 ∈ V 𝐶 ∈ (Moore‘𝑥) → 𝐶 ∈ (Moore‘∪ 𝐶))
9	3, 8	sylbi 220	. 2 ⊢ (𝐶 ∈ ∪ ran Moore → 𝐶 ∈ (Moore‘∪ 𝐶))
10		fvssunirn 6908	. . 3 ⊢ (Moore‘∪ 𝐶) ⊆ ∪ ran Moore
11	10	sseli 3927	. 2 ⊢ (𝐶 ∈ (Moore‘∪ 𝐶) → 𝐶 ∈ ∪ ran Moore)
12	9, 11	impbii 212	1 ⊢ (𝐶 ∈ ∪ ran Moore ↔ 𝐶 ∈ (Moore‘∪ 𝐶))

This proof depends on syntax axioms:   ↔ wb 209   ∈ wcel 2145  ∃wrex 3087  Vcvv 3451  ∪ cuni 4867  ran crn 5652   Fn wfn 6526  ‘cfv 6531  Moorecmre 17732

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-iota 6487  df-fun 6533  df-fn 6534  df-fv 6539  df-mre 17736

This theorem is used by:  fnmrc  17761  mrcfval  17762