Theorem mreunirn 17678

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 17668	. . . 4 ⊢ Moore Fn V
2		fnunirn 7258	. . . 4 ⊢ (Moore Fn V → (𝐶 ∈ ∪ ran Moore ↔ ∃𝑥 ∈ V 𝐶 ∈ (Moore‘𝑥)))
3	1, 2	ax-mp 5	. . 3 ⊢ (𝐶 ∈ ∪ ran Moore ↔ ∃𝑥 ∈ V 𝐶 ∈ (Moore‘𝑥))
4		mreuni 17677	. . . . . . 7 ⊢ (𝐶 ∈ (Moore‘𝑥) → ∪ 𝐶 = 𝑥)
5	4	fveq2d 6892	. . . . . 6 ⊢ (𝐶 ∈ (Moore‘𝑥) → (Moore‘∪ 𝐶) = (Moore‘𝑥))
6	5	eleq2d 2852	. . . . 5 ⊢ (𝐶 ∈ (Moore‘𝑥) → (𝐶 ∈ (Moore‘∪ 𝐶) ↔ 𝐶 ∈ (Moore‘𝑥)))
7	6	ibir 271	. . . 4 ⊢ (𝐶 ∈ (Moore‘𝑥) → 𝐶 ∈ (Moore‘∪ 𝐶))
8	7	rexlimivw 3165	. . 3 ⊢ (∃𝑥 ∈ V 𝐶 ∈ (Moore‘𝑥) → 𝐶 ∈ (Moore‘∪ 𝐶))
9	3, 8	sylbi 220	. 2 ⊢ (𝐶 ∈ ∪ ran Moore → 𝐶 ∈ (Moore‘∪ 𝐶))
10		fvssunirn 6919	. . 3 ⊢ (Moore‘∪ 𝐶) ⊆ ∪ ran Moore
11	10	sseli 3936	. 2 ⊢ (𝐶 ∈ (Moore‘∪ 𝐶) → 𝐶 ∈ ∪ ran Moore)
12	9, 11	impbii 212	1 ⊢ (𝐶 ∈ ∪ ran Moore ↔ 𝐶 ∈ (Moore‘∪ 𝐶))

This proof depends on syntax axioms:   ↔ wb 209   ∈ wcel 2146  ∃wrex 3092  Vcvv 3458  ∪ cuni 4877  ran crn 5667   Fn wfn 6538  ‘cfv 6543  Moorecmre 17659

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409

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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-iota 6499  df-fun 6545  df-fn 6546  df-fv 6551  df-mre 17663

This theorem is used by:  fnmrc  17688  mrcfval  17689