Theorem eliunov2 44664

Description: Membership in 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 element is a member of that operator value. Generalized from dfrtrclrec2 15204. (Contributed by RP, 1-Jun-2020.)

Hypothesis

Ref	Expression
mptiunov2.def	⊢ 𝐶 = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛))

Assertion

Ref	Expression
eliunov2	⊢ ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉) → (𝑋 ∈ (𝐶‘𝑅) ↔ ∃𝑛 ∈ 𝑁 𝑋 ∈ (𝑅 ↑ 𝑛)))

Distinct variable groups:   𝑛,𝑟,𝐶,𝑁, ↑   𝑅,𝑛,𝑟   𝑛,𝑋

Allowed substitution hints:   𝑈(𝑛, 𝑟)   𝑉(𝑛, 𝑟)   𝑋(𝑟)

Proof of Theorem eliunov2

Step	Hyp	Ref	Expression
1		eqid 2761	. . . 4 ⊢ (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛)) = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛))
2		oveq1 7425	. . . . 5 ⊢ (𝑟 = 𝑅 → (𝑟 ↑ 𝑛) = (𝑅 ↑ 𝑛))
3	2	iuneq2d 4981	. . . 4 ⊢ (𝑟 = 𝑅 → ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛) = ∪ 𝑛 ∈ 𝑁 (𝑅 ↑ 𝑛))
4		elex 3472	. . . . 5 ⊢ (𝑅 ∈ 𝑈 → 𝑅 ∈ V)
5	4	adantr 486	. . . 4 ⊢ ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉) → 𝑅 ∈ V)
6		simpr 490	. . . . 5 ⊢ ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉) → 𝑁 ∈ 𝑉)
7		ovex 7451	. . . . . 6 ⊢ (𝑅 ↑ 𝑛) ∈ V
8	7	rgenw 3081	. . . . 5 ⊢ ∀𝑛 ∈ 𝑁 (𝑅 ↑ 𝑛) ∈ V
9		iunexg 7973	. . . . 5 ⊢ ((𝑁 ∈ 𝑉 ∧ ∀𝑛 ∈ 𝑁 (𝑅 ↑ 𝑛) ∈ V) → ∪ 𝑛 ∈ 𝑁 (𝑅 ↑ 𝑛) ∈ V)
10	6, 8, 9	sylancl 598	. . . 4 ⊢ ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉) → ∪ 𝑛 ∈ 𝑁 (𝑅 ↑ 𝑛) ∈ V)
11	1, 3, 5, 10	fvmptd3 7015	. . 3 ⊢ ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉) → ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛))‘𝑅) = ∪ 𝑛 ∈ 𝑁 (𝑅 ↑ 𝑛))
12		eleq2 2850	. . . 4 ⊢ (((𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛))‘𝑅) = ∪ 𝑛 ∈ 𝑁 (𝑅 ↑ 𝑛) → (𝑋 ∈ ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛))‘𝑅) ↔ 𝑋 ∈ ∪ 𝑛 ∈ 𝑁 (𝑅 ↑ 𝑛)))
13		eliun 4955	. . . . 5 ⊢ (𝑋 ∈ ∪ 𝑛 ∈ 𝑁 (𝑅 ↑ 𝑛) ↔ ∃𝑛 ∈ 𝑁 𝑋 ∈ (𝑅 ↑ 𝑛))
14	13	a1i 11	. . . 4 ⊢ ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉) → (𝑋 ∈ ∪ 𝑛 ∈ 𝑁 (𝑅 ↑ 𝑛) ↔ ∃𝑛 ∈ 𝑁 𝑋 ∈ (𝑅 ↑ 𝑛)))
15	12, 14	sylan9bb 519	. . 3 ⊢ ((((𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛))‘𝑅) = ∪ 𝑛 ∈ 𝑁 (𝑅 ↑ 𝑛) ∧ (𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉)) → (𝑋 ∈ ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛))‘𝑅) ↔ ∃𝑛 ∈ 𝑁 𝑋 ∈ (𝑅 ↑ 𝑛)))
16	11, 15	mpancom 701	. 2 ⊢ ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉) → (𝑋 ∈ ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛))‘𝑅) ↔ ∃𝑛 ∈ 𝑁 𝑋 ∈ (𝑅 ↑ 𝑛)))
17		mptiunov2.def	. . 3 ⊢ 𝐶 = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛))
18		fveq1 6882	. . . . . 6 ⊢ (𝐶 = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛)) → (𝐶‘𝑅) = ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛))‘𝑅))
19	18	eleq2d 2847	. . . . 5 ⊢ (𝐶 = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛)) → (𝑋 ∈ (𝐶‘𝑅) ↔ 𝑋 ∈ ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛))‘𝑅)))
20	19	bibi1d 346	. . . 4 ⊢ (𝐶 = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛)) → ((𝑋 ∈ (𝐶‘𝑅) ↔ ∃𝑛 ∈ 𝑁 𝑋 ∈ (𝑅 ↑ 𝑛)) ↔ (𝑋 ∈ ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛))‘𝑅) ↔ ∃𝑛 ∈ 𝑁 𝑋 ∈ (𝑅 ↑ 𝑛))))
21	20	imbi2d 343	. . 3 ⊢ (𝐶 = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛)) → (((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉) → (𝑋 ∈ (𝐶‘𝑅) ↔ ∃𝑛 ∈ 𝑁 𝑋 ∈ (𝑅 ↑ 𝑛))) ↔ ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉) → (𝑋 ∈ ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛))‘𝑅) ↔ ∃𝑛 ∈ 𝑁 𝑋 ∈ (𝑅 ↑ 𝑛)))))
22	17, 21	ax-mp 5	. 2 ⊢ (((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉) → (𝑋 ∈ (𝐶‘𝑅) ↔ ∃𝑛 ∈ 𝑁 𝑋 ∈ (𝑅 ↑ 𝑛))) ↔ ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉) → (𝑋 ∈ ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛))‘𝑅) ↔ ∃𝑛 ∈ 𝑁 𝑋 ∈ (𝑅 ↑ 𝑛))))
23	16, 22	mpbir 234	1 ⊢ ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉) → (𝑋 ∈ (𝐶‘𝑅) ↔ ∃𝑛 ∈ 𝑁 𝑋 ∈ (𝑅 ↑ 𝑛)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077  ∃wrex 3087  Vcvv 3451  ∪ ciun 4951   ↦ cmpt 5186  ‘cfv 6537  (class class class)co 7418

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-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7749

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-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  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-iota 6493  df-fun 6539  df-fv 6545  df-ov 7421

This theorem is used by:  eltrclrec  44665  elrtrclrec  44666  briunov2  44667  eliunov2uz  44684  ov2ssiunov2  44685