Theorem eliunov2 43417

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 15084. (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 2729	. . . 4 ⊢ (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛)) = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛))
2		oveq1 7437	. . . . 5 ⊢ (𝑟 = 𝑅 → (𝑟 ↑ 𝑛) = (𝑅 ↑ 𝑛))
3	2	iuneq2d 5035	. . . 4 ⊢ (𝑟 = 𝑅 → ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛) = ∪ 𝑛 ∈ 𝑁 (𝑅 ↑ 𝑛))
4		elex 3493	. . . . 5 ⊢ (𝑅 ∈ 𝑈 → 𝑅 ∈ V)
5	4	adantr 479	. . . 4 ⊢ ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉) → 𝑅 ∈ V)
6		simpr 483	. . . . 5 ⊢ ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉) → 𝑁 ∈ 𝑉)
7		ovex 7463	. . . . . 6 ⊢ (𝑅 ↑ 𝑛) ∈ V
8	7	rgenw 3058	. . . . 5 ⊢ ∀𝑛 ∈ 𝑁 (𝑅 ↑ 𝑛) ∈ V
9		iunexg 7985	. . . . 5 ⊢ ((𝑁 ∈ 𝑉 ∧ ∀𝑛 ∈ 𝑁 (𝑅 ↑ 𝑛) ∈ V) → ∪ 𝑛 ∈ 𝑁 (𝑅 ↑ 𝑛) ∈ V)
10	6, 8, 9	sylancl 584	. . . 4 ⊢ ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉) → ∪ 𝑛 ∈ 𝑁 (𝑅 ↑ 𝑛) ∈ V)
11	1, 3, 5, 10	fvmptd3 7037	. . 3 ⊢ ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉) → ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛))‘𝑅) = ∪ 𝑛 ∈ 𝑁 (𝑅 ↑ 𝑛))
12		eleq2 2818	. . . 4 ⊢ (((𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛))‘𝑅) = ∪ 𝑛 ∈ 𝑁 (𝑅 ↑ 𝑛) → (𝑋 ∈ ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛))‘𝑅) ↔ 𝑋 ∈ ∪ 𝑛 ∈ 𝑁 (𝑅 ↑ 𝑛)))
13		eliun 5010	. . . . 5 ⊢ (𝑋 ∈ ∪ 𝑛 ∈ 𝑁 (𝑅 ↑ 𝑛) ↔ ∃𝑛 ∈ 𝑁 𝑋 ∈ (𝑅 ↑ 𝑛))
14	13	a1i 11	. . . 4 ⊢ ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉) → (𝑋 ∈ ∪ 𝑛 ∈ 𝑁 (𝑅 ↑ 𝑛) ↔ ∃𝑛 ∈ 𝑁 𝑋 ∈ (𝑅 ↑ 𝑛)))
15	12, 14	sylan9bb 508	. . 3 ⊢ ((((𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛))‘𝑅) = ∪ 𝑛 ∈ 𝑁 (𝑅 ↑ 𝑛) ∧ (𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉)) → (𝑋 ∈ ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛))‘𝑅) ↔ ∃𝑛 ∈ 𝑁 𝑋 ∈ (𝑅 ↑ 𝑛)))
16	11, 15	mpancom 686	. 2 ⊢ ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉) → (𝑋 ∈ ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛))‘𝑅) ↔ ∃𝑛 ∈ 𝑁 𝑋 ∈ (𝑅 ↑ 𝑛)))
17		mptiunov2.def	. . 3 ⊢ 𝐶 = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛))
18		fveq1 6904	. . . . . 6 ⊢ (𝐶 = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛)) → (𝐶‘𝑅) = ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛))‘𝑅))
19	18	eleq2d 2815	. . . . 5 ⊢ (𝐶 = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛)) → (𝑋 ∈ (𝐶‘𝑅) ↔ 𝑋 ∈ ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛))‘𝑅)))
20	19	bibi1d 342	. . . 4 ⊢ (𝐶 = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛)) → ((𝑋 ∈ (𝐶‘𝑅) ↔ ∃𝑛 ∈ 𝑁 𝑋 ∈ (𝑅 ↑ 𝑛)) ↔ (𝑋 ∈ ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛))‘𝑅) ↔ ∃𝑛 ∈ 𝑁 𝑋 ∈ (𝑅 ↑ 𝑛))))
21	20	imbi2d 339	. . 3 ⊢ (𝐶 = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛)) → (((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉) → (𝑋 ∈ (𝐶‘𝑅) ↔ ∃𝑛 ∈ 𝑁 𝑋 ∈ (𝑅 ↑ 𝑛))) ↔ ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉) → (𝑋 ∈ ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛))‘𝑅) ↔ ∃𝑛 ∈ 𝑁 𝑋 ∈ (𝑅 ↑ 𝑛)))))
22	17, 21	ax-mp 5	. 2 ⊢ (((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉) → (𝑋 ∈ (𝐶‘𝑅) ↔ ∃𝑛 ∈ 𝑁 𝑋 ∈ (𝑅 ↑ 𝑛))) ↔ ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉) → (𝑋 ∈ ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛))‘𝑅) ↔ ∃𝑛 ∈ 𝑁 𝑋 ∈ (𝑅 ↑ 𝑛))))
23	16, 22	mpbir 230	1 ⊢ ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉) → (𝑋 ∈ (𝐶‘𝑅) ↔ ∃𝑛 ∈ 𝑁 𝑋 ∈ (𝑅 ↑ 𝑛)))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 394   = wceq 1534   ∈ wcel 2100  ∀wral 3054  ∃wrex 3063  Vcvv 3472  ∪ ciun 5006   ↦ cmpt 5239  ‘cfv 6558  (class class class)co 7430

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2102  ax-9 2110  ax-10 2133  ax-11 2150  ax-12 2170  ax-ext 2700  ax-rep 5293  ax-sep 5307  ax-nul 5314  ax-pr 5437  ax-un 7751

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2062  df-mo 2532  df-eu 2561  df-clab 2707  df-cleq 2721  df-clel 2806  df-nfc 2881  df-ne 2934  df-ral 3055  df-rex 3064  df-rab 3429  df-v 3474  df-dif 3962  df-un 3964  df-ss 3976  df-nul 4336  df-if 4537  df-sn 4637  df-pr 4639  df-op 4643  df-uni 4919  df-iun 5008  df-br 5157  df-opab 5219  df-mpt 5240  df-id 5584  df-xp 5692  df-rel 5693  df-cnv 5694  df-co 5695  df-dm 5696  df-iota 6510  df-fun 6560  df-fv 6566  df-ov 7433

This theorem is referenced by:  eltrclrec  43418  elrtrclrec  43419  briunov2  43420  eliunov2uz  43437  ov2ssiunov2  43438