| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fconst2g | Structured version Visualization version GIF version | ||
| Description: A constant function expressed as a Cartesian product. (Contributed by NM, 27-Nov-2007.) |
| Ref | Expression |
|---|---|
| fconst2g | ⊢ (𝐵 ∈ 𝐶 → (𝐹:𝐴⟶{𝐵} ↔ 𝐹 = (𝐴 × {𝐵}))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fvconst 7191 | . . . . . . 7 ⊢ ((𝐹:𝐴⟶{𝐵} ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = 𝐵) | |
| 2 | 1 | adantlr 728 | . . . . . 6 ⊢ (((𝐹:𝐴⟶{𝐵} ∧ 𝐵 ∈ 𝐶) ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = 𝐵) |
| 3 | fvconst2g 7231 | . . . . . . 7 ⊢ ((𝐵 ∈ 𝐶 ∧ 𝑥 ∈ 𝐴) → ((𝐴 × {𝐵})‘𝑥) = 𝐵) | |
| 4 | 3 | adantll 727 | . . . . . 6 ⊢ (((𝐹:𝐴⟶{𝐵} ∧ 𝐵 ∈ 𝐶) ∧ 𝑥 ∈ 𝐴) → ((𝐴 × {𝐵})‘𝑥) = 𝐵) |
| 5 | 2, 4 | eqtr4d 2801 | . . . . 5 ⊢ (((𝐹:𝐴⟶{𝐵} ∧ 𝐵 ∈ 𝐶) ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = ((𝐴 × {𝐵})‘𝑥)) |
| 6 | 5 | ralrimiva 3158 | . . . 4 ⊢ ((𝐹:𝐴⟶{𝐵} ∧ 𝐵 ∈ 𝐶) → ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = ((𝐴 × {𝐵})‘𝑥)) |
| 7 | ffn 6731 | . . . . 5 ⊢ (𝐹:𝐴⟶{𝐵} → 𝐹 Fn 𝐴) | |
| 8 | fnconstg 6792 | . . . . 5 ⊢ (𝐵 ∈ 𝐶 → (𝐴 × {𝐵}) Fn 𝐴) | |
| 9 | eqfnfv 7052 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ (𝐴 × {𝐵}) Fn 𝐴) → (𝐹 = (𝐴 × {𝐵}) ↔ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = ((𝐴 × {𝐵})‘𝑥))) | |
| 10 | 7, 8, 9 | syl2an 608 | . . . 4 ⊢ ((𝐹:𝐴⟶{𝐵} ∧ 𝐵 ∈ 𝐶) → (𝐹 = (𝐴 × {𝐵}) ↔ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = ((𝐴 × {𝐵})‘𝑥))) |
| 11 | 6, 10 | mpbird 260 | . . 3 ⊢ ((𝐹:𝐴⟶{𝐵} ∧ 𝐵 ∈ 𝐶) → 𝐹 = (𝐴 × {𝐵})) |
| 12 | 11 | expcom 419 | . 2 ⊢ (𝐵 ∈ 𝐶 → (𝐹:𝐴⟶{𝐵} → 𝐹 = (𝐴 × {𝐵}))) |
| 13 | fconstg 6791 | . . 3 ⊢ (𝐵 ∈ 𝐶 → (𝐴 × {𝐵}):𝐴⟶{𝐵}) | |
| 14 | feq1 6709 | . . 3 ⊢ (𝐹 = (𝐴 × {𝐵}) → (𝐹:𝐴⟶{𝐵} ↔ (𝐴 × {𝐵}):𝐴⟶{𝐵})) | |
| 15 | 13, 14 | syl5ibrcom 250 | . 2 ⊢ (𝐵 ∈ 𝐶 → (𝐹 = (𝐴 × {𝐵}) → 𝐹:𝐴⟶{𝐵})) |
| 16 | 12, 15 | impbid 215 | 1 ⊢ (𝐵 ∈ 𝐶 → (𝐹:𝐴⟶{𝐵} ↔ 𝐹 = (𝐴 × {𝐵}))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∀wral 3080 {csn 4588 × cxp 5653 Fn wfn 6553 ⟶wf 6554 ‘cfv 6558 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pr 5395 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5171 df-mpt 5190 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-fv 6566 |
| This theorem is used by: fconst2 7234 fconst5 7235 snmapen 9094 repsdf2 14957 cnconst 23632 fconst7v 33286 padct 33381 prv1n 36363 fconst7 46481 eufsnlem 50157 mofsn 50160 mofeu 50164 |
| Copyright terms: Public domain | W3C validator |