Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > fconst4m | GIF version |
Description: Two ways to express a constant function. (Contributed by NM, 8-Mar-2007.) |
Ref | Expression |
---|---|
fconst4m | ⊢ (∃𝑥 𝑥 ∈ 𝐴 → (𝐹:𝐴⟶{𝐵} ↔ (𝐹 Fn 𝐴 ∧ (◡𝐹 “ {𝐵}) = 𝐴))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fconst3m 5380 | . 2 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → (𝐹:𝐴⟶{𝐵} ↔ (𝐹 Fn 𝐴 ∧ 𝐴 ⊆ (◡𝐹 “ {𝐵})))) | |
2 | cnvimass 4688 | . . . . . 6 ⊢ (◡𝐹 “ {𝐵}) ⊆ dom 𝐹 | |
3 | fndm 4998 | . . . . . 6 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴) | |
4 | 2, 3 | syl5sseq 2993 | . . . . 5 ⊢ (𝐹 Fn 𝐴 → (◡𝐹 “ {𝐵}) ⊆ 𝐴) |
5 | 4 | biantrurd 289 | . . . 4 ⊢ (𝐹 Fn 𝐴 → (𝐴 ⊆ (◡𝐹 “ {𝐵}) ↔ ((◡𝐹 “ {𝐵}) ⊆ 𝐴 ∧ 𝐴 ⊆ (◡𝐹 “ {𝐵})))) |
6 | eqss 2960 | . . . 4 ⊢ ((◡𝐹 “ {𝐵}) = 𝐴 ↔ ((◡𝐹 “ {𝐵}) ⊆ 𝐴 ∧ 𝐴 ⊆ (◡𝐹 “ {𝐵}))) | |
7 | 5, 6 | syl6bbr 187 | . . 3 ⊢ (𝐹 Fn 𝐴 → (𝐴 ⊆ (◡𝐹 “ {𝐵}) ↔ (◡𝐹 “ {𝐵}) = 𝐴)) |
8 | 7 | pm5.32i 427 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ⊆ (◡𝐹 “ {𝐵})) ↔ (𝐹 Fn 𝐴 ∧ (◡𝐹 “ {𝐵}) = 𝐴)) |
9 | 1, 8 | syl6bb 185 | 1 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → (𝐹:𝐴⟶{𝐵} ↔ (𝐹 Fn 𝐴 ∧ (◡𝐹 “ {𝐵}) = 𝐴))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 97 ↔ wb 98 = wceq 1243 ∃wex 1381 ∈ wcel 1393 ⊆ wss 2917 {csn 3375 ◡ccnv 4344 dom cdm 4345 “ cima 4348 Fn wfn 4897 ⟶wf 4898 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-14 1405 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 ax-sep 3875 ax-pow 3927 ax-pr 3944 |
This theorem depends on definitions: df-bi 110 df-3an 887 df-tru 1246 df-nf 1350 df-sb 1646 df-eu 1903 df-mo 1904 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ral 2311 df-rex 2312 df-v 2559 df-sbc 2765 df-un 2922 df-in 2924 df-ss 2931 df-pw 3361 df-sn 3381 df-pr 3382 df-op 3384 df-uni 3581 df-br 3765 df-opab 3819 df-mpt 3820 df-id 4030 df-xp 4351 df-rel 4352 df-cnv 4353 df-co 4354 df-dm 4355 df-rn 4356 df-res 4357 df-ima 4358 df-iota 4867 df-fun 4904 df-fn 4905 df-f 4906 df-fo 4908 df-fv 4910 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |