| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fliftfuns | GIF version | ||
| Description: The function 𝐹 is the unique function defined by 𝐹‘𝐴 = 𝐵, provided that the well-definedness condition holds. (Contributed by Mario Carneiro, 23-Dec-2016.) |
| Ref | Expression |
|---|---|
| flift.1 | ⊢ 𝐹 = ran (𝑥 ∈ 𝑋 ↦ 〈𝐴, 𝐵〉) |
| flift.2 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ 𝑅) |
| flift.3 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐵 ∈ 𝑆) |
| Ref | Expression |
|---|---|
| fliftfuns | ⊢ (𝜑 → (Fun 𝐹 ↔ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (⦋𝑦 / 𝑥⦌𝐴 = ⦋𝑧 / 𝑥⦌𝐴 → ⦋𝑦 / 𝑥⦌𝐵 = ⦋𝑧 / 𝑥⦌𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | flift.1 | . . 3 ⊢ 𝐹 = ran (𝑥 ∈ 𝑋 ↦ 〈𝐴, 𝐵〉) | |
| 2 | nfcv 2392 | . . . . 5 ⊢ Ⅎ𝑦〈𝐴, 𝐵〉 | |
| 3 | nfcsb1v 3180 | . . . . . 6 ⊢ Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐴 | |
| 4 | nfcsb1v 3180 | . . . . . 6 ⊢ Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐵 | |
| 5 | 3, 4 | nfop 3915 | . . . . 5 ⊢ Ⅎ𝑥〈⦋𝑦 / 𝑥⦌𝐴, ⦋𝑦 / 𝑥⦌𝐵〉 |
| 6 | csbeq1a 3156 | . . . . . 6 ⊢ (𝑥 = 𝑦 → 𝐴 = ⦋𝑦 / 𝑥⦌𝐴) | |
| 7 | csbeq1a 3156 | . . . . . 6 ⊢ (𝑥 = 𝑦 → 𝐵 = ⦋𝑦 / 𝑥⦌𝐵) | |
| 8 | 6, 7 | opeq12d 3907 | . . . . 5 ⊢ (𝑥 = 𝑦 → 〈𝐴, 𝐵〉 = 〈⦋𝑦 / 𝑥⦌𝐴, ⦋𝑦 / 𝑥⦌𝐵〉) |
| 9 | 2, 5, 8 | cbvmpt 4221 | . . . 4 ⊢ (𝑥 ∈ 𝑋 ↦ 〈𝐴, 𝐵〉) = (𝑦 ∈ 𝑋 ↦ 〈⦋𝑦 / 𝑥⦌𝐴, ⦋𝑦 / 𝑥⦌𝐵〉) |
| 10 | 9 | rneqi 5005 | . . 3 ⊢ ran (𝑥 ∈ 𝑋 ↦ 〈𝐴, 𝐵〉) = ran (𝑦 ∈ 𝑋 ↦ 〈⦋𝑦 / 𝑥⦌𝐴, ⦋𝑦 / 𝑥⦌𝐵〉) |
| 11 | 1, 10 | eqtri 2259 | . 2 ⊢ 𝐹 = ran (𝑦 ∈ 𝑋 ↦ 〈⦋𝑦 / 𝑥⦌𝐴, ⦋𝑦 / 𝑥⦌𝐵〉) |
| 12 | flift.2 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ 𝑅) | |
| 13 | 12 | ralrimiva 2623 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 𝐴 ∈ 𝑅) |
| 14 | 3 | nfel1 2403 | . . . 4 ⊢ Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐴 ∈ 𝑅 |
| 15 | 6 | eleq1d 2307 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝐴 ∈ 𝑅 ↔ ⦋𝑦 / 𝑥⦌𝐴 ∈ 𝑅)) |
| 16 | 14, 15 | rspc 2923 | . . 3 ⊢ (𝑦 ∈ 𝑋 → (∀𝑥 ∈ 𝑋 𝐴 ∈ 𝑅 → ⦋𝑦 / 𝑥⦌𝐴 ∈ 𝑅)) |
| 17 | 13, 16 | mpan9 281 | . 2 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → ⦋𝑦 / 𝑥⦌𝐴 ∈ 𝑅) |
| 18 | flift.3 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐵 ∈ 𝑆) | |
| 19 | 18 | ralrimiva 2623 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 𝐵 ∈ 𝑆) |
| 20 | 4 | nfel1 2403 | . . . 4 ⊢ Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐵 ∈ 𝑆 |
| 21 | 7 | eleq1d 2307 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝐵 ∈ 𝑆 ↔ ⦋𝑦 / 𝑥⦌𝐵 ∈ 𝑆)) |
| 22 | 20, 21 | rspc 2923 | . . 3 ⊢ (𝑦 ∈ 𝑋 → (∀𝑥 ∈ 𝑋 𝐵 ∈ 𝑆 → ⦋𝑦 / 𝑥⦌𝐵 ∈ 𝑆)) |
| 23 | 19, 22 | mpan9 281 | . 2 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → ⦋𝑦 / 𝑥⦌𝐵 ∈ 𝑆) |
| 24 | csbeq1 3150 | . 2 ⊢ (𝑦 = 𝑧 → ⦋𝑦 / 𝑥⦌𝐴 = ⦋𝑧 / 𝑥⦌𝐴) | |
| 25 | csbeq1 3150 | . 2 ⊢ (𝑦 = 𝑧 → ⦋𝑦 / 𝑥⦌𝐵 = ⦋𝑧 / 𝑥⦌𝐵) | |
| 26 | 11, 17, 23, 24, 25 | fliftfun 5992 | 1 ⊢ (𝜑 → (Fun 𝐹 ↔ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (⦋𝑦 / 𝑥⦌𝐴 = ⦋𝑧 / 𝑥⦌𝐴 → ⦋𝑦 / 𝑥⦌𝐵 = ⦋𝑧 / 𝑥⦌𝐵))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1402 ∈ wcel 2209 ∀wral 2528 ⦋csb 3147 〈cop 3708 ↦ cmpt 4187 ran crn 4770 Fun wfun 5366 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4244 ax-pow 4306 ax-pr 4341 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-un 3224 df-in 3226 df-ss 3233 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-br 4126 df-opab 4188 df-mpt 4189 df-id 4433 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-rn 4780 df-res 4781 df-ima 4782 df-iota 5332 df-fun 5374 df-fn 5375 df-f 5376 df-fv 5380 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |