![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > elovmpowrd | Structured version Visualization version GIF version |
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.) |
Ref | Expression |
---|---|
elovmpowrd.o | ⊢ 𝑂 = (𝑣 ∈ V, 𝑦 ∈ V ↦ {𝑧 ∈ Word 𝑣 ∣ 𝜑}) |
Ref | Expression |
---|---|
elovmpowrd | ⊢ (𝑍 ∈ (𝑉𝑂𝑌) → (𝑉 ∈ V ∧ 𝑌 ∈ V ∧ 𝑍 ∈ Word 𝑉)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elovmpowrd.o | . . . 4 ⊢ 𝑂 = (𝑣 ∈ V, 𝑦 ∈ V ↦ {𝑧 ∈ Word 𝑣 ∣ 𝜑}) | |
2 | csbwrdg 14579 | . . . . . . . 8 ⊢ (𝑣 ∈ V → ⦋𝑣 / 𝑥⦌Word 𝑥 = Word 𝑣) | |
3 | 2 | eqcomd 2741 | . . . . . . 7 ⊢ (𝑣 ∈ V → Word 𝑣 = ⦋𝑣 / 𝑥⦌Word 𝑥) |
4 | 3 | adantr 480 | . . . . . 6 ⊢ ((𝑣 ∈ V ∧ 𝑦 ∈ V) → Word 𝑣 = ⦋𝑣 / 𝑥⦌Word 𝑥) |
5 | 4 | rabeqdv 3449 | . . . . 5 ⊢ ((𝑣 ∈ V ∧ 𝑦 ∈ V) → {𝑧 ∈ Word 𝑣 ∣ 𝜑} = {𝑧 ∈ ⦋𝑣 / 𝑥⦌Word 𝑥 ∣ 𝜑}) |
6 | 5 | mpoeq3ia 7511 | . . . 4 ⊢ (𝑣 ∈ V, 𝑦 ∈ V ↦ {𝑧 ∈ Word 𝑣 ∣ 𝜑}) = (𝑣 ∈ V, 𝑦 ∈ V ↦ {𝑧 ∈ ⦋𝑣 / 𝑥⦌Word 𝑥 ∣ 𝜑}) |
7 | 1, 6 | eqtri 2763 | . . 3 ⊢ 𝑂 = (𝑣 ∈ V, 𝑦 ∈ V ↦ {𝑧 ∈ ⦋𝑣 / 𝑥⦌Word 𝑥 ∣ 𝜑}) |
8 | csbwrdg 14579 | . . . . 5 ⊢ (𝑉 ∈ V → ⦋𝑉 / 𝑥⦌Word 𝑥 = Word 𝑉) | |
9 | wrdexg 14559 | . . . . 5 ⊢ (𝑉 ∈ V → Word 𝑉 ∈ V) | |
10 | 8, 9 | eqeltrd 2839 | . . . 4 ⊢ (𝑉 ∈ V → ⦋𝑉 / 𝑥⦌Word 𝑥 ∈ V) |
11 | 10 | adantr 480 | . . 3 ⊢ ((𝑉 ∈ V ∧ 𝑌 ∈ V) → ⦋𝑉 / 𝑥⦌Word 𝑥 ∈ V) |
12 | 7, 11 | elovmporab1w 7680 | . 2 ⊢ (𝑍 ∈ (𝑉𝑂𝑌) → (𝑉 ∈ V ∧ 𝑌 ∈ V ∧ 𝑍 ∈ ⦋𝑉 / 𝑥⦌Word 𝑥)) |
13 | 8 | eleq2d 2825 | . . . . 5 ⊢ (𝑉 ∈ V → (𝑍 ∈ ⦋𝑉 / 𝑥⦌Word 𝑥 ↔ 𝑍 ∈ Word 𝑉)) |
14 | 13 | adantr 480 | . . . 4 ⊢ ((𝑉 ∈ V ∧ 𝑌 ∈ V) → (𝑍 ∈ ⦋𝑉 / 𝑥⦌Word 𝑥 ↔ 𝑍 ∈ Word 𝑉)) |
15 | id 22 | . . . . 5 ⊢ ((𝑉 ∈ V ∧ 𝑌 ∈ V ∧ 𝑍 ∈ Word 𝑉) → (𝑉 ∈ V ∧ 𝑌 ∈ V ∧ 𝑍 ∈ Word 𝑉)) | |
16 | 15 | 3expia 1120 | . . . 4 ⊢ ((𝑉 ∈ V ∧ 𝑌 ∈ V) → (𝑍 ∈ Word 𝑉 → (𝑉 ∈ V ∧ 𝑌 ∈ V ∧ 𝑍 ∈ Word 𝑉))) |
17 | 14, 16 | sylbid 240 | . . 3 ⊢ ((𝑉 ∈ V ∧ 𝑌 ∈ V) → (𝑍 ∈ ⦋𝑉 / 𝑥⦌Word 𝑥 → (𝑉 ∈ V ∧ 𝑌 ∈ V ∧ 𝑍 ∈ Word 𝑉))) |
18 | 17 | 3impia 1116 | . 2 ⊢ ((𝑉 ∈ V ∧ 𝑌 ∈ V ∧ 𝑍 ∈ ⦋𝑉 / 𝑥⦌Word 𝑥) → (𝑉 ∈ V ∧ 𝑌 ∈ V ∧ 𝑍 ∈ Word 𝑉)) |
19 | 12, 18 | syl 17 | 1 ⊢ (𝑍 ∈ (𝑉𝑂𝑌) → (𝑉 ∈ V ∧ 𝑌 ∈ V ∧ 𝑍 ∈ Word 𝑉)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1537 ∈ wcel 2106 {crab 3433 Vcvv 3478 ⦋csb 3908 (class class class)co 7431 ∈ cmpo 7433 Word cword 14549 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-rep 5285 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-cnex 11209 ax-1cn 11211 ax-addcl 11213 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-ral 3060 df-rex 3069 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-2nd 8014 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-map 8867 df-nn 12265 df-n0 12525 df-word 14550 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |