Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > fmptdf | GIF version |
Description: A version of fmptd 5633 using bound-variable hypothesis instead of a distinct variable condition for 𝜑. (Contributed by Glauco Siliprandi, 29-Jun-2017.) |
Ref | Expression |
---|---|
fmptdf.1 | ⊢ Ⅎ𝑥𝜑 |
fmptdf.2 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝐶) |
fmptdf.3 | ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵) |
Ref | Expression |
---|---|
fmptdf | ⊢ (𝜑 → 𝐹:𝐴⟶𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fmptdf.1 | . . 3 ⊢ Ⅎ𝑥𝜑 | |
2 | fmptdf.2 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝐶) | |
3 | 2 | ex 114 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → 𝐵 ∈ 𝐶)) |
4 | 1, 3 | ralrimi 2535 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶) |
5 | fmptdf.3 | . . 3 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵) | |
6 | 5 | fmpt 5629 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶 ↔ 𝐹:𝐴⟶𝐶) |
7 | 4, 6 | sylib 121 | 1 ⊢ (𝜑 → 𝐹:𝐴⟶𝐶) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1342 Ⅎwnf 1447 ∈ wcel 2135 ∀wral 2442 ↦ cmpt 4037 ⟶wf 5178 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1434 ax-7 1435 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-10 1492 ax-11 1493 ax-i12 1494 ax-bndl 1496 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 ax-i5r 1522 ax-14 2138 ax-ext 2146 ax-sep 4094 ax-pow 4147 ax-pr 4181 |
This theorem depends on definitions: df-bi 116 df-3an 969 df-tru 1345 df-nf 1448 df-sb 1750 df-eu 2016 df-mo 2017 df-clab 2151 df-cleq 2157 df-clel 2160 df-nfc 2295 df-ral 2447 df-rex 2448 df-rab 2451 df-v 2723 df-sbc 2947 df-un 3115 df-in 3117 df-ss 3124 df-pw 3555 df-sn 3576 df-pr 3577 df-op 3579 df-uni 3784 df-br 3977 df-opab 4038 df-mpt 4039 df-id 4265 df-xp 4604 df-rel 4605 df-cnv 4606 df-co 4607 df-dm 4608 df-rn 4609 df-res 4610 df-ima 4611 df-iota 5147 df-fun 5184 df-fn 5185 df-f 5186 df-fv 5190 |
This theorem is referenced by: mkvprop 7113 |
Copyright terms: Public domain | W3C validator |