| 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 2372 | . . . . 5 ⊢ Ⅎ𝑦〈𝐴, 𝐵〉 | |
| 3 | nfcsb1v 3158 | . . . . . 6 ⊢ Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐴 | |
| 4 | nfcsb1v 3158 | . . . . . 6 ⊢ Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐵 | |
| 5 | 3, 4 | nfop 3874 | . . . . 5 ⊢ Ⅎ𝑥〈⦋𝑦 / 𝑥⦌𝐴, ⦋𝑦 / 𝑥⦌𝐵〉 |
| 6 | csbeq1a 3134 | . . . . . 6 ⊢ (𝑥 = 𝑦 → 𝐴 = ⦋𝑦 / 𝑥⦌𝐴) | |
| 7 | csbeq1a 3134 | . . . . . 6 ⊢ (𝑥 = 𝑦 → 𝐵 = ⦋𝑦 / 𝑥⦌𝐵) | |
| 8 | 6, 7 | opeq12d 3866 | . . . . 5 ⊢ (𝑥 = 𝑦 → 〈𝐴, 𝐵〉 = 〈⦋𝑦 / 𝑥⦌𝐴, ⦋𝑦 / 𝑥⦌𝐵〉) |
| 9 | 2, 5, 8 | cbvmpt 4180 | . . . 4 ⊢ (𝑥 ∈ 𝑋 ↦ 〈𝐴, 𝐵〉) = (𝑦 ∈ 𝑋 ↦ 〈⦋𝑦 / 𝑥⦌𝐴, ⦋𝑦 / 𝑥⦌𝐵〉) |
| 10 | 9 | rneqi 4956 | . . 3 ⊢ ran (𝑥 ∈ 𝑋 ↦ 〈𝐴, 𝐵〉) = ran (𝑦 ∈ 𝑋 ↦ 〈⦋𝑦 / 𝑥⦌𝐴, ⦋𝑦 / 𝑥⦌𝐵〉) |
| 11 | 1, 10 | eqtri 2250 | . 2 ⊢ 𝐹 = ran (𝑦 ∈ 𝑋 ↦ 〈⦋𝑦 / 𝑥⦌𝐴, ⦋𝑦 / 𝑥⦌𝐵〉) |
| 12 | flift.2 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ 𝑅) | |
| 13 | 12 | ralrimiva 2603 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 𝐴 ∈ 𝑅) |
| 14 | 3 | nfel1 2383 | . . . 4 ⊢ Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐴 ∈ 𝑅 |
| 15 | 6 | eleq1d 2298 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝐴 ∈ 𝑅 ↔ ⦋𝑦 / 𝑥⦌𝐴 ∈ 𝑅)) |
| 16 | 14, 15 | rspc 2902 | . . 3 ⊢ (𝑦 ∈ 𝑋 → (∀𝑥 ∈ 𝑋 𝐴 ∈ 𝑅 → ⦋𝑦 / 𝑥⦌𝐴 ∈ 𝑅)) |
| 17 | 13, 16 | mpan9 281 | . 2 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → ⦋𝑦 / 𝑥⦌𝐴 ∈ 𝑅) |
| 18 | flift.3 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐵 ∈ 𝑆) | |
| 19 | 18 | ralrimiva 2603 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 𝐵 ∈ 𝑆) |
| 20 | 4 | nfel1 2383 | . . . 4 ⊢ Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐵 ∈ 𝑆 |
| 21 | 7 | eleq1d 2298 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝐵 ∈ 𝑆 ↔ ⦋𝑦 / 𝑥⦌𝐵 ∈ 𝑆)) |
| 22 | 20, 21 | rspc 2902 | . . 3 ⊢ (𝑦 ∈ 𝑋 → (∀𝑥 ∈ 𝑋 𝐵 ∈ 𝑆 → ⦋𝑦 / 𝑥⦌𝐵 ∈ 𝑆)) |
| 23 | 19, 22 | mpan9 281 | . 2 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → ⦋𝑦 / 𝑥⦌𝐵 ∈ 𝑆) |
| 24 | csbeq1 3128 | . 2 ⊢ (𝑦 = 𝑧 → ⦋𝑦 / 𝑥⦌𝐴 = ⦋𝑧 / 𝑥⦌𝐴) | |
| 25 | csbeq1 3128 | . 2 ⊢ (𝑦 = 𝑧 → ⦋𝑦 / 𝑥⦌𝐵 = ⦋𝑧 / 𝑥⦌𝐵) | |
| 26 | 11, 17, 23, 24, 25 | fliftfun 5930 | 1 ⊢ (𝜑 → (Fun 𝐹 ↔ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (⦋𝑦 / 𝑥⦌𝐴 = ⦋𝑧 / 𝑥⦌𝐴 → ⦋𝑦 / 𝑥⦌𝐵 = ⦋𝑧 / 𝑥⦌𝐵))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1395 ∈ wcel 2200 ∀wral 2508 ⦋csb 3125 〈cop 3670 ↦ cmpt 4146 ran crn 4722 Fun wfun 5316 |
| 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 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-14 2203 ax-ext 2211 ax-sep 4203 ax-pow 4260 ax-pr 4295 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ral 2513 df-rex 2514 df-rab 2517 df-v 2802 df-sbc 3030 df-csb 3126 df-un 3202 df-in 3204 df-ss 3211 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3890 df-br 4085 df-opab 4147 df-mpt 4148 df-id 4386 df-xp 4727 df-rel 4728 df-cnv 4729 df-co 4730 df-dm 4731 df-rn 4732 df-res 4733 df-ima 4734 df-iota 5282 df-fun 5324 df-fn 5325 df-f 5326 df-fv 5330 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |