|   | 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 14582 | . . . . . . . 8 ⊢ (𝑣 ∈ V → ⦋𝑣 / 𝑥⦌Word 𝑥 = Word 𝑣) | |
| 3 | 2 | eqcomd 2743 | . . . . . . 7 ⊢ (𝑣 ∈ V → Word 𝑣 = ⦋𝑣 / 𝑥⦌Word 𝑥) | 
| 4 | 3 | adantr 480 | . . . . . 6 ⊢ ((𝑣 ∈ V ∧ 𝑦 ∈ V) → Word 𝑣 = ⦋𝑣 / 𝑥⦌Word 𝑥) | 
| 5 | 4 | rabeqdv 3452 | . . . . 5 ⊢ ((𝑣 ∈ V ∧ 𝑦 ∈ V) → {𝑧 ∈ Word 𝑣 ∣ 𝜑} = {𝑧 ∈ ⦋𝑣 / 𝑥⦌Word 𝑥 ∣ 𝜑}) | 
| 6 | 5 | mpoeq3ia 7511 | . . . 4 ⊢ (𝑣 ∈ V, 𝑦 ∈ V ↦ {𝑧 ∈ Word 𝑣 ∣ 𝜑}) = (𝑣 ∈ V, 𝑦 ∈ V ↦ {𝑧 ∈ ⦋𝑣 / 𝑥⦌Word 𝑥 ∣ 𝜑}) | 
| 7 | 1, 6 | eqtri 2765 | . . 3 ⊢ 𝑂 = (𝑣 ∈ V, 𝑦 ∈ V ↦ {𝑧 ∈ ⦋𝑣 / 𝑥⦌Word 𝑥 ∣ 𝜑}) | 
| 8 | csbwrdg 14582 | . . . . 5 ⊢ (𝑉 ∈ V → ⦋𝑉 / 𝑥⦌Word 𝑥 = Word 𝑉) | |
| 9 | wrdexg 14562 | . . . . 5 ⊢ (𝑉 ∈ V → Word 𝑉 ∈ V) | |
| 10 | 8, 9 | eqeltrd 2841 | . . . 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 2827 | . . . . 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 1122 | . . . 4 ⊢ ((𝑉 ∈ V ∧ 𝑌 ∈ V) → (𝑍 ∈ Word 𝑉 → (𝑉 ∈ V ∧ 𝑌 ∈ V ∧ 𝑍 ∈ Word 𝑉))) | 
| 17 | 14, 16 | sylbid 240 | . . 3 ⊢ ((𝑉 ∈ V ∧ 𝑌 ∈ V) → (𝑍 ∈ ⦋𝑉 / 𝑥⦌Word 𝑥 → (𝑉 ∈ V ∧ 𝑌 ∈ V ∧ 𝑍 ∈ Word 𝑉))) | 
| 18 | 17 | 3impia 1118 | . 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 1087 = wceq 1540 ∈ wcel 2108 {crab 3436 Vcvv 3480 ⦋csb 3899 (class class class)co 7431 ∈ cmpo 7433 Word cword 14552 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-rep 5279 ax-sep 5296 ax-nul 5306 ax-pow 5365 ax-pr 5432 ax-un 7755 ax-cnex 11211 ax-1cn 11213 ax-addcl 11215 | 
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-ral 3062 df-rex 3071 df-reu 3381 df-rab 3437 df-v 3482 df-sbc 3789 df-csb 3900 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-pss 3971 df-nul 4334 df-if 4526 df-pw 4602 df-sn 4627 df-pr 4629 df-op 4633 df-uni 4908 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5226 df-tr 5260 df-id 5578 df-eprel 5584 df-po 5592 df-so 5593 df-fr 5637 df-we 5639 df-xp 5691 df-rel 5692 df-cnv 5693 df-co 5694 df-dm 5695 df-rn 5696 df-res 5697 df-ima 5698 df-pred 6321 df-ord 6387 df-on 6388 df-lim 6389 df-suc 6390 df-iota 6514 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-2nd 8015 df-frecs 8306 df-wrecs 8337 df-recs 8411 df-rdg 8450 df-map 8868 df-nn 12267 df-n0 12527 df-word 14553 | 
| This theorem is referenced by: (None) | 
| Copyright terms: Public domain | W3C validator |