![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > oemapval | Structured version Visualization version GIF version |
Description: Value of the relation 𝑇. (Contributed by Mario Carneiro, 28-May-2015.) |
Ref | Expression |
---|---|
cantnfs.s | ⊢ 𝑆 = dom (𝐴 CNF 𝐵) |
cantnfs.a | ⊢ (𝜑 → 𝐴 ∈ On) |
cantnfs.b | ⊢ (𝜑 → 𝐵 ∈ On) |
oemapval.t | ⊢ 𝑇 = {〈𝑥, 𝑦〉 ∣ ∃𝑧 ∈ 𝐵 ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)))} |
oemapval.f | ⊢ (𝜑 → 𝐹 ∈ 𝑆) |
oemapval.g | ⊢ (𝜑 → 𝐺 ∈ 𝑆) |
Ref | Expression |
---|---|
oemapval | ⊢ (𝜑 → (𝐹𝑇𝐺 ↔ ∃𝑧 ∈ 𝐵 ((𝐹‘𝑧) ∈ (𝐺‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝐹‘𝑤) = (𝐺‘𝑤))))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | oemapval.f | . 2 ⊢ (𝜑 → 𝐹 ∈ 𝑆) | |
2 | oemapval.g | . 2 ⊢ (𝜑 → 𝐺 ∈ 𝑆) | |
3 | fveq1 6900 | . . . . . 6 ⊢ (𝑥 = 𝐹 → (𝑥‘𝑧) = (𝐹‘𝑧)) | |
4 | fveq1 6900 | . . . . . 6 ⊢ (𝑦 = 𝐺 → (𝑦‘𝑧) = (𝐺‘𝑧)) | |
5 | eleq12 2816 | . . . . . 6 ⊢ (((𝑥‘𝑧) = (𝐹‘𝑧) ∧ (𝑦‘𝑧) = (𝐺‘𝑧)) → ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ↔ (𝐹‘𝑧) ∈ (𝐺‘𝑧))) | |
6 | 3, 4, 5 | syl2an 594 | . . . . 5 ⊢ ((𝑥 = 𝐹 ∧ 𝑦 = 𝐺) → ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ↔ (𝐹‘𝑧) ∈ (𝐺‘𝑧))) |
7 | fveq1 6900 | . . . . . . . 8 ⊢ (𝑥 = 𝐹 → (𝑥‘𝑤) = (𝐹‘𝑤)) | |
8 | fveq1 6900 | . . . . . . . 8 ⊢ (𝑦 = 𝐺 → (𝑦‘𝑤) = (𝐺‘𝑤)) | |
9 | 7, 8 | eqeqan12d 2740 | . . . . . . 7 ⊢ ((𝑥 = 𝐹 ∧ 𝑦 = 𝐺) → ((𝑥‘𝑤) = (𝑦‘𝑤) ↔ (𝐹‘𝑤) = (𝐺‘𝑤))) |
10 | 9 | imbi2d 339 | . . . . . 6 ⊢ ((𝑥 = 𝐹 ∧ 𝑦 = 𝐺) → ((𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)) ↔ (𝑧 ∈ 𝑤 → (𝐹‘𝑤) = (𝐺‘𝑤)))) |
11 | 10 | ralbidv 3168 | . . . . 5 ⊢ ((𝑥 = 𝐹 ∧ 𝑦 = 𝐺) → (∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)) ↔ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝐹‘𝑤) = (𝐺‘𝑤)))) |
12 | 6, 11 | anbi12d 630 | . . . 4 ⊢ ((𝑥 = 𝐹 ∧ 𝑦 = 𝐺) → (((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤))) ↔ ((𝐹‘𝑧) ∈ (𝐺‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝐹‘𝑤) = (𝐺‘𝑤))))) |
13 | 12 | rexbidv 3169 | . . 3 ⊢ ((𝑥 = 𝐹 ∧ 𝑦 = 𝐺) → (∃𝑧 ∈ 𝐵 ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤))) ↔ ∃𝑧 ∈ 𝐵 ((𝐹‘𝑧) ∈ (𝐺‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝐹‘𝑤) = (𝐺‘𝑤))))) |
14 | oemapval.t | . . 3 ⊢ 𝑇 = {〈𝑥, 𝑦〉 ∣ ∃𝑧 ∈ 𝐵 ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)))} | |
15 | 13, 14 | brabga 5540 | . 2 ⊢ ((𝐹 ∈ 𝑆 ∧ 𝐺 ∈ 𝑆) → (𝐹𝑇𝐺 ↔ ∃𝑧 ∈ 𝐵 ((𝐹‘𝑧) ∈ (𝐺‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝐹‘𝑤) = (𝐺‘𝑤))))) |
16 | 1, 2, 15 | syl2anc 582 | 1 ⊢ (𝜑 → (𝐹𝑇𝐺 ↔ ∃𝑧 ∈ 𝐵 ((𝐹‘𝑧) ∈ (𝐺‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝐹‘𝑤) = (𝐺‘𝑤))))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 = wceq 1534 ∈ wcel 2099 ∀wral 3051 ∃wrex 3060 class class class wbr 5153 {copab 5215 dom cdm 5682 Oncon0 6376 ‘cfv 6554 (class class class)co 7424 CNF ccnf 9704 |
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 2101 ax-9 2109 ax-ext 2697 ax-sep 5304 ax-nul 5311 ax-pr 5433 |
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-sb 2061 df-clab 2704 df-cleq 2718 df-clel 2803 df-ral 3052 df-rex 3061 df-rab 3420 df-v 3464 df-dif 3950 df-un 3952 df-ss 3964 df-nul 4326 df-if 4534 df-sn 4634 df-pr 4636 df-op 4640 df-uni 4914 df-br 5154 df-opab 5216 df-iota 6506 df-fv 6562 |
This theorem is referenced by: oemapvali 9727 |
Copyright terms: Public domain | W3C validator |