Metamath Proof Explorer


Theorem briunov2uz

Description: Two classes related by the indexed union over operator values where the index varies the second input is equivalent to the existence of at least one index such that the two classes are related by that operator value. The index set N is restricted to an upper range of integers. (Contributed by RP, 2-Jun-2020)

Ref Expression
Hypothesis briunov2uz.def 𝐶 = ( 𝑟 ∈ V ↦ 𝑛𝑁 ( 𝑟 𝑛 ) )
Assertion briunov2uz ( ( 𝑅𝑈𝑁 = ( ℤ𝑀 ) ) → ( 𝑋 ( 𝐶𝑅 ) 𝑌 ↔ ∃ 𝑛𝑁 𝑋 ( 𝑅 𝑛 ) 𝑌 ) )

Proof

Step Hyp Ref Expression
1 briunov2uz.def 𝐶 = ( 𝑟 ∈ V ↦ 𝑛𝑁 ( 𝑟 𝑛 ) )
2 simpr ( ( 𝑅𝑈𝑁 = ( ℤ𝑀 ) ) → 𝑁 = ( ℤ𝑀 ) )
3 fvex ( ℤ𝑀 ) ∈ V
4 2 3 eqeltrdi ( ( 𝑅𝑈𝑁 = ( ℤ𝑀 ) ) → 𝑁 ∈ V )
5 1 briunov2 ( ( 𝑅𝑈𝑁 ∈ V ) → ( 𝑋 ( 𝐶𝑅 ) 𝑌 ↔ ∃ 𝑛𝑁 𝑋 ( 𝑅 𝑛 ) 𝑌 ) )
6 4 5 syldan ( ( 𝑅𝑈𝑁 = ( ℤ𝑀 ) ) → ( 𝑋 ( 𝐶𝑅 ) 𝑌 ↔ ∃ 𝑛𝑁 𝑋 ( 𝑅 𝑛 ) 𝑌 ) )