MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  mreunirn Structured version   Visualization version   GIF version

Theorem mreunirn 17525
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.
StepHypRef Expression
1 fnmre 17515 . . . 4 Moore Fn V
2 fnunirn 7202 . . . 4 (Moore Fn V → (𝐶 ran Moore ↔ ∃𝑥 ∈ V 𝐶 ∈ (Moore‘𝑥)))
31, 2ax-mp 5 . . 3 (𝐶 ran Moore ↔ ∃𝑥 ∈ V 𝐶 ∈ (Moore‘𝑥))
4 mreuni 17524 . . . . . . 7 (𝐶 ∈ (Moore‘𝑥) → 𝐶 = 𝑥)
54fveq2d 6839 . . . . . 6 (𝐶 ∈ (Moore‘𝑥) → (Moore‘ 𝐶) = (Moore‘𝑥))
65eleq2d 2823 . . . . 5 (𝐶 ∈ (Moore‘𝑥) → (𝐶 ∈ (Moore‘ 𝐶) ↔ 𝐶 ∈ (Moore‘𝑥)))
76ibir 268 . . . 4 (𝐶 ∈ (Moore‘𝑥) → 𝐶 ∈ (Moore‘ 𝐶))
87rexlimivw 3134 . . 3 (∃𝑥 ∈ V 𝐶 ∈ (Moore‘𝑥) → 𝐶 ∈ (Moore‘ 𝐶))
93, 8sylbi 217 . 2 (𝐶 ran Moore → 𝐶 ∈ (Moore‘ 𝐶))
10 fvssunirn 6866 . . 3 (Moore‘ 𝐶) ⊆ ran Moore
1110sseli 3930 . 2 (𝐶 ∈ (Moore‘ 𝐶) → 𝐶 ran Moore)
129, 11impbii 209 1 (𝐶 ran Moore ↔ 𝐶 ∈ (Moore‘ 𝐶))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wcel 2114  wrex 3061  Vcvv 3441   cuni 4864  ran crn 5626   Fn wfn 6488  cfv 6493  Moorecmre 17506
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 5242  ax-nul 5252  ax-pow 5311  ax-pr 5378
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 3062  df-rab 3401  df-v 3443  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-iota 6449  df-fun 6495  df-fn 6496  df-fv 6501  df-mre 17510
This theorem is referenced by:  fnmrc  17535  mrcfval  17536
  Copyright terms: Public domain W3C validator