Theorem elovmpowrd 14656

Description: Implications for the value of an operation defined by the maps-to notation with a class abstraction of words as a result having an element. Note that 𝜑 may depend on 𝑧 as well as on 𝑣 and 𝑦. (Contributed by Alexander van der Vekens, 15-Jul-2018.)

Hypothesis

Ref	Expression
elovmpowrd.o	⊢ 𝑂 = (𝑣 ∈ V, 𝑦 ∈ V ↦ {𝑧 ∈ Word 𝑣 ∣ 𝜑})

Assertion

Ref	Expression
elovmpowrd	⊢ (𝑍 ∈ (𝑉𝑂𝑌) → (𝑉 ∈ V ∧ 𝑌 ∈ V ∧ 𝑍 ∈ Word 𝑉))

Distinct variable groups:   𝑣,𝑉,𝑦,𝑧   𝑣,𝑌,𝑦,𝑧   𝑧,𝑍

Allowed substitution hints:   𝜑(𝑦, 𝑧, 𝑣)   𝑂(𝑦, 𝑧, 𝑣)   𝑍(𝑦, 𝑣)

Proof of Theorem elovmpowrd

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elovmpowrd.o	. . . 4 ⊢ 𝑂 = (𝑣 ∈ V, 𝑦 ∈ V ↦ {𝑧 ∈ Word 𝑣 ∣ 𝜑})
2		csbwrdg 14642	. . . . . . . 8 ⊢ (𝑣 ∈ V → ⦋𝑣 / 𝑥⦌Word 𝑥 = Word 𝑣)
3	2	eqcomd 2766	. . . . . . 7 ⊢ (𝑣 ∈ V → Word 𝑣 = ⦋𝑣 / 𝑥⦌Word 𝑥)
4	3	adantr 486	. . . . . 6 ⊢ ((𝑣 ∈ V ∧ 𝑦 ∈ V) → Word 𝑣 = ⦋𝑣 / 𝑥⦌Word 𝑥)
5	4	rabeqdv 3427	. . . . 5 ⊢ ((𝑣 ∈ V ∧ 𝑦 ∈ V) → {𝑧 ∈ Word 𝑣 ∣ 𝜑} = {𝑧 ∈ ⦋𝑣 / 𝑥⦌Word 𝑥 ∣ 𝜑})
6	5	mpoeq3ia 7487	. . . 4 ⊢ (𝑣 ∈ V, 𝑦 ∈ V ↦ {𝑧 ∈ Word 𝑣 ∣ 𝜑}) = (𝑣 ∈ V, 𝑦 ∈ V ↦ {𝑧 ∈ ⦋𝑣 / 𝑥⦌Word 𝑥 ∣ 𝜑})
7	1, 6	eqtri 2783	. . 3 ⊢ 𝑂 = (𝑣 ∈ V, 𝑦 ∈ V ↦ {𝑧 ∈ ⦋𝑣 / 𝑥⦌Word 𝑥 ∣ 𝜑})
8		csbwrdg 14642	. . . . 5 ⊢ (𝑉 ∈ V → ⦋𝑉 / 𝑥⦌Word 𝑥 = Word 𝑉)
9		wrdexg 14622	. . . . 5 ⊢ (𝑉 ∈ V → Word 𝑉 ∈ V)
10	8, 9	eqeltrd 2860	. . . 4 ⊢ (𝑉 ∈ V → ⦋𝑉 / 𝑥⦌Word 𝑥 ∈ V)
11	10	adantr 486	. . 3 ⊢ ((𝑉 ∈ V ∧ 𝑌 ∈ V) → ⦋𝑉 / 𝑥⦌Word 𝑥 ∈ V)
12	7, 11	elovmporab1w 7657	. 2 ⊢ (𝑍 ∈ (𝑉𝑂𝑌) → (𝑉 ∈ V ∧ 𝑌 ∈ V ∧ 𝑍 ∈ ⦋𝑉 / 𝑥⦌Word 𝑥))
13	8	eleq2d 2846	. . . . 5 ⊢ (𝑉 ∈ V → (𝑍 ∈ ⦋𝑉 / 𝑥⦌Word 𝑥 ↔ 𝑍 ∈ Word 𝑉))
14	13	adantr 486	. . . 4 ⊢ ((𝑉 ∈ V ∧ 𝑌 ∈ V) → (𝑍 ∈ ⦋𝑉 / 𝑥⦌Word 𝑥 ↔ 𝑍 ∈ Word 𝑉))
15		id 23	. . . . 5 ⊢ ((𝑉 ∈ V ∧ 𝑌 ∈ V ∧ 𝑍 ∈ Word 𝑉) → (𝑉 ∈ V ∧ 𝑌 ∈ V ∧ 𝑍 ∈ Word 𝑉))
16	15	3expia 1139	. . . 4 ⊢ ((𝑉 ∈ V ∧ 𝑌 ∈ V) → (𝑍 ∈ Word 𝑉 → (𝑉 ∈ V ∧ 𝑌 ∈ V ∧ 𝑍 ∈ Word 𝑉)))
17	14, 16	sylbid 243	. . 3 ⊢ ((𝑉 ∈ V ∧ 𝑌 ∈ V) → (𝑍 ∈ ⦋𝑉 / 𝑥⦌Word 𝑥 → (𝑉 ∈ V ∧ 𝑌 ∈ V ∧ 𝑍 ∈ Word 𝑉)))
18	17	3impia 1135	. 2 ⊢ ((𝑉 ∈ V ∧ 𝑌 ∈ V ∧ 𝑍 ∈ ⦋𝑉 / 𝑥⦌Word 𝑥) → (𝑉 ∈ V ∧ 𝑌 ∈ V ∧ 𝑍 ∈ Word 𝑉))
19	12, 18	syl 18	1 ⊢ (𝑍 ∈ (𝑉𝑂𝑌) → (𝑉 ∈ V ∧ 𝑌 ∈ V ∧ 𝑍 ∈ Word 𝑉))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  {crab 3412  Vcvv 3450  ⦋csb 3847  (class class class)co 7409   ∈ cmpo 7411  Word cword 14611

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 2732  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7735  ax-cnex 11213  ax-1cn 11215  ax-addcl 11217

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  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-tr 5213  df-id 5543  df-eprel 5548  df-po 5556  df-so 5557  df-fr 5601  df-we 5603  df-xp 5654  df-rel 5655  df-cnv 5656  df-co 5657  df-dm 5658  df-rn 5659  df-res 5660  df-ima 5661  df-pred 6294  df-ord 6355  df-on 6356  df-lim 6357  df-suc 6358  df-iota 6484  df-fun 6530  df-fn 6531  df-f 6532  df-f1 6533  df-fo 6534  df-f1o 6535  df-fv 6536  df-ov 7412  df-oprab 7413  df-mpo 7414  df-om 7862  df-2nd 7986  df-frecs 8278  df-wrecs 8309  df-recs 8358  df-rdg 8397  df-map 8828  df-nn 12291  df-n0 12562  df-word 14612

This theorem is used by: (None)