| 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 7135 | . . . . . . 7 ⊢ ((𝐹:𝐴⟶{𝐵} ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = 𝐵) | |
| 2 | 1 | adantlr 723 | . . . . . 6 ⊢ (((𝐹:𝐴⟶{𝐵} ∧ 𝐵 ∈ 𝐶) ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = 𝐵) |
| 3 | fvconst2g 7175 | . . . . . . 7 ⊢ ((𝐵 ∈ 𝐶 ∧ 𝑥 ∈ 𝐴) → ((𝐴 × {𝐵})‘𝑥) = 𝐵) | |
| 4 | 3 | adantll 722 | . . . . . 6 ⊢ (((𝐹:𝐴⟶{𝐵} ∧ 𝐵 ∈ 𝐶) ∧ 𝑥 ∈ 𝐴) → ((𝐴 × {𝐵})‘𝑥) = 𝐵) |
| 5 | 2, 4 | eqtr4d 2794 | . . . . 5 ⊢ (((𝐹:𝐴⟶{𝐵} ∧ 𝐵 ∈ 𝐶) ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = ((𝐴 × {𝐵})‘𝑥)) |
| 6 | 5 | ralrimiva 3148 | . . . 4 ⊢ ((𝐹:𝐴⟶{𝐵} ∧ 𝐵 ∈ 𝐶) → ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = ((𝐴 × {𝐵})‘𝑥)) |
| 7 | ffn 6680 | . . . . 5 ⊢ (𝐹:𝐴⟶{𝐵} → 𝐹 Fn 𝐴) | |
| 8 | fnconstg 6741 | . . . . 5 ⊢ (𝐵 ∈ 𝐶 → (𝐴 × {𝐵}) Fn 𝐴) | |
| 9 | eqfnfv 7000 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ (𝐴 × {𝐵}) Fn 𝐴) → (𝐹 = (𝐴 × {𝐵}) ↔ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = ((𝐴 × {𝐵})‘𝑥))) | |
| 10 | 7, 8, 9 | syl2an 604 | . . . 4 ⊢ ((𝐹:𝐴⟶{𝐵} ∧ 𝐵 ∈ 𝐶) → (𝐹 = (𝐴 × {𝐵}) ↔ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = ((𝐴 × {𝐵})‘𝑥))) |
| 11 | 6, 10 | mpbird 259 | . . 3 ⊢ ((𝐹:𝐴⟶{𝐵} ∧ 𝐵 ∈ 𝐶) → 𝐹 = (𝐴 × {𝐵})) |
| 12 | 11 | expcom 416 | . 2 ⊢ (𝐵 ∈ 𝐶 → (𝐹:𝐴⟶{𝐵} → 𝐹 = (𝐴 × {𝐵}))) |
| 13 | fconstg 6740 | . . 3 ⊢ (𝐵 ∈ 𝐶 → (𝐴 × {𝐵}):𝐴⟶{𝐵}) | |
| 14 | feq1 6658 | . . 3 ⊢ (𝐹 = (𝐴 × {𝐵}) → (𝐹:𝐴⟶{𝐵} ↔ (𝐴 × {𝐵}):𝐴⟶{𝐵})) | |
| 15 | 13, 14 | syl5ibrcom 249 | . 2 ⊢ (𝐵 ∈ 𝐶 → (𝐹 = (𝐴 × {𝐵}) → 𝐹:𝐴⟶{𝐵})) |
| 16 | 12, 15 | impbid 214 | 1 ⊢ (𝐵 ∈ 𝐶 → (𝐹:𝐴⟶{𝐵} ↔ 𝐹 = (𝐴 × {𝐵}))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1554 ∈ wcel 2136 ∀wral 3070 {csn 4576 × cxp 5638 Fn wfn 6505 ⟶wf 6506 ‘cfv 6510 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1809 ax-4 1823 ax-5 1924 ax-6 1981 ax-7 2022 ax-8 2138 ax-9 2146 ax-10 2169 ax-11 2185 ax-12 2206 ax-ext 2728 ax-sep 5240 ax-nul 5250 ax-pr 5384 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3an 1097 df-tru 1557 df-fal 1567 df-ex 1794 df-nf 1798 df-sb 2085 df-mo 2560 df-eu 2590 df-clab 2735 df-cleq 2748 df-clel 2831 df-nfc 2905 df-ne 2952 df-ral 3071 df-rex 3081 df-rab 3409 df-v 3450 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4281 df-if 4475 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-br 5095 df-opab 5157 df-mpt 5176 df-id 5535 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-iota 6466 df-fun 6512 df-fn 6513 df-f 6514 df-fv 6518 |
| This theorem is referenced by: fconst2 7178 fconst5 7179 snmapen 9008 repsdf2 14781 cnconst 23317 fconst7v 32765 padct 32863 prv1n 35729 fconst7 45787 eufsnlem 49410 mofsn 49413 mofeu 49417 |
| Copyright terms: Public domain | W3C validator |