| 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 6821 | . . . . . 6 ⊢ (𝑥 = 𝐹 → (𝑥‘𝑧) = (𝐹‘𝑧)) | |
| 4 | fveq1 6821 | . . . . . 6 ⊢ (𝑦 = 𝐺 → (𝑦‘𝑧) = (𝐺‘𝑧)) | |
| 5 | eleq12 2821 | . . . . . 6 ⊢ (((𝑥‘𝑧) = (𝐹‘𝑧) ∧ (𝑦‘𝑧) = (𝐺‘𝑧)) → ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ↔ (𝐹‘𝑧) ∈ (𝐺‘𝑧))) | |
| 6 | 3, 4, 5 | syl2an 596 | . . . . 5 ⊢ ((𝑥 = 𝐹 ∧ 𝑦 = 𝐺) → ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ↔ (𝐹‘𝑧) ∈ (𝐺‘𝑧))) |
| 7 | fveq1 6821 | . . . . . . . 8 ⊢ (𝑥 = 𝐹 → (𝑥‘𝑤) = (𝐹‘𝑤)) | |
| 8 | fveq1 6821 | . . . . . . . 8 ⊢ (𝑦 = 𝐺 → (𝑦‘𝑤) = (𝐺‘𝑤)) | |
| 9 | 7, 8 | eqeqan12d 2745 | . . . . . . 7 ⊢ ((𝑥 = 𝐹 ∧ 𝑦 = 𝐺) → ((𝑥‘𝑤) = (𝑦‘𝑤) ↔ (𝐹‘𝑤) = (𝐺‘𝑤))) |
| 10 | 9 | imbi2d 340 | . . . . . 6 ⊢ ((𝑥 = 𝐹 ∧ 𝑦 = 𝐺) → ((𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)) ↔ (𝑧 ∈ 𝑤 → (𝐹‘𝑤) = (𝐺‘𝑤)))) |
| 11 | 10 | ralbidv 3155 | . . . . 5 ⊢ ((𝑥 = 𝐹 ∧ 𝑦 = 𝐺) → (∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)) ↔ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝐹‘𝑤) = (𝐺‘𝑤)))) |
| 12 | 6, 11 | anbi12d 632 | . . . 4 ⊢ ((𝑥 = 𝐹 ∧ 𝑦 = 𝐺) → (((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤))) ↔ ((𝐹‘𝑧) ∈ (𝐺‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝐹‘𝑤) = (𝐺‘𝑤))))) |
| 13 | 12 | rexbidv 3156 | . . 3 ⊢ ((𝑥 = 𝐹 ∧ 𝑦 = 𝐺) → (∃𝑧 ∈ 𝐵 ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤))) ↔ ∃𝑧 ∈ 𝐵 ((𝐹‘𝑧) ∈ (𝐺‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝐹‘𝑤) = (𝐺‘𝑤))))) |
| 14 | oemapval.t | . . 3 ⊢ 𝑇 = {〈𝑥, 𝑦〉 ∣ ∃𝑧 ∈ 𝐵 ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)))} | |
| 15 | 13, 14 | brabga 5474 | . 2 ⊢ ((𝐹 ∈ 𝑆 ∧ 𝐺 ∈ 𝑆) → (𝐹𝑇𝐺 ↔ ∃𝑧 ∈ 𝐵 ((𝐹‘𝑧) ∈ (𝐺‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝐹‘𝑤) = (𝐺‘𝑤))))) |
| 16 | 1, 2, 15 | syl2anc 584 | 1 ⊢ (𝜑 → (𝐹𝑇𝐺 ↔ ∃𝑧 ∈ 𝐵 ((𝐹‘𝑧) ∈ (𝐺‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝐹‘𝑤) = (𝐺‘𝑤))))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2111 ∀wral 3047 ∃wrex 3056 class class class wbr 5091 {copab 5153 dom cdm 5616 Oncon0 6306 ‘cfv 6481 (class class class)co 7346 CNF ccnf 9551 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-ext 2703 ax-sep 5234 ax-nul 5244 ax-pr 5370 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2710 df-cleq 2723 df-clel 2806 df-ral 3048 df-rex 3057 df-rab 3396 df-v 3438 df-dif 3905 df-un 3907 df-ss 3919 df-nul 4284 df-if 4476 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-br 5092 df-opab 5154 df-iota 6437 df-fv 6489 |
| This theorem is referenced by: oemapvali 9574 |
| Copyright terms: Public domain | W3C validator |