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 2299 | . . . . 5 ⊢ Ⅎ𝑦〈𝐴, 𝐵〉 | |
3 | nfcsb1v 3064 | . . . . . 6 ⊢ Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐴 | |
4 | nfcsb1v 3064 | . . . . . 6 ⊢ Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐵 | |
5 | 3, 4 | nfop 3759 | . . . . 5 ⊢ Ⅎ𝑥〈⦋𝑦 / 𝑥⦌𝐴, ⦋𝑦 / 𝑥⦌𝐵〉 |
6 | csbeq1a 3040 | . . . . . 6 ⊢ (𝑥 = 𝑦 → 𝐴 = ⦋𝑦 / 𝑥⦌𝐴) | |
7 | csbeq1a 3040 | . . . . . 6 ⊢ (𝑥 = 𝑦 → 𝐵 = ⦋𝑦 / 𝑥⦌𝐵) | |
8 | 6, 7 | opeq12d 3751 | . . . . 5 ⊢ (𝑥 = 𝑦 → 〈𝐴, 𝐵〉 = 〈⦋𝑦 / 𝑥⦌𝐴, ⦋𝑦 / 𝑥⦌𝐵〉) |
9 | 2, 5, 8 | cbvmpt 4062 | . . . 4 ⊢ (𝑥 ∈ 𝑋 ↦ 〈𝐴, 𝐵〉) = (𝑦 ∈ 𝑋 ↦ 〈⦋𝑦 / 𝑥⦌𝐴, ⦋𝑦 / 𝑥⦌𝐵〉) |
10 | 9 | rneqi 4817 | . . 3 ⊢ ran (𝑥 ∈ 𝑋 ↦ 〈𝐴, 𝐵〉) = ran (𝑦 ∈ 𝑋 ↦ 〈⦋𝑦 / 𝑥⦌𝐴, ⦋𝑦 / 𝑥⦌𝐵〉) |
11 | 1, 10 | eqtri 2178 | . 2 ⊢ 𝐹 = ran (𝑦 ∈ 𝑋 ↦ 〈⦋𝑦 / 𝑥⦌𝐴, ⦋𝑦 / 𝑥⦌𝐵〉) |
12 | flift.2 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ 𝑅) | |
13 | 12 | ralrimiva 2530 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 𝐴 ∈ 𝑅) |
14 | 3 | nfel1 2310 | . . . 4 ⊢ Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐴 ∈ 𝑅 |
15 | 6 | eleq1d 2226 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝐴 ∈ 𝑅 ↔ ⦋𝑦 / 𝑥⦌𝐴 ∈ 𝑅)) |
16 | 14, 15 | rspc 2810 | . . 3 ⊢ (𝑦 ∈ 𝑋 → (∀𝑥 ∈ 𝑋 𝐴 ∈ 𝑅 → ⦋𝑦 / 𝑥⦌𝐴 ∈ 𝑅)) |
17 | 13, 16 | mpan9 279 | . 2 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → ⦋𝑦 / 𝑥⦌𝐴 ∈ 𝑅) |
18 | flift.3 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐵 ∈ 𝑆) | |
19 | 18 | ralrimiva 2530 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 𝐵 ∈ 𝑆) |
20 | 4 | nfel1 2310 | . . . 4 ⊢ Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐵 ∈ 𝑆 |
21 | 7 | eleq1d 2226 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝐵 ∈ 𝑆 ↔ ⦋𝑦 / 𝑥⦌𝐵 ∈ 𝑆)) |
22 | 20, 21 | rspc 2810 | . . 3 ⊢ (𝑦 ∈ 𝑋 → (∀𝑥 ∈ 𝑋 𝐵 ∈ 𝑆 → ⦋𝑦 / 𝑥⦌𝐵 ∈ 𝑆)) |
23 | 19, 22 | mpan9 279 | . 2 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → ⦋𝑦 / 𝑥⦌𝐵 ∈ 𝑆) |
24 | csbeq1 3034 | . 2 ⊢ (𝑦 = 𝑧 → ⦋𝑦 / 𝑥⦌𝐴 = ⦋𝑧 / 𝑥⦌𝐴) | |
25 | csbeq1 3034 | . 2 ⊢ (𝑦 = 𝑧 → ⦋𝑦 / 𝑥⦌𝐵 = ⦋𝑧 / 𝑥⦌𝐵) | |
26 | 11, 17, 23, 24, 25 | fliftfun 5749 | 1 ⊢ (𝜑 → (Fun 𝐹 ↔ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (⦋𝑦 / 𝑥⦌𝐴 = ⦋𝑧 / 𝑥⦌𝐴 → ⦋𝑦 / 𝑥⦌𝐵 = ⦋𝑧 / 𝑥⦌𝐵))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 = wceq 1335 ∈ wcel 2128 ∀wral 2435 ⦋csb 3031 〈cop 3564 ↦ cmpt 4028 ran crn 4590 Fun wfun 5167 |
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 1427 ax-7 1428 ax-gen 1429 ax-ie1 1473 ax-ie2 1474 ax-8 1484 ax-10 1485 ax-11 1486 ax-i12 1487 ax-bndl 1489 ax-4 1490 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-14 2131 ax-ext 2139 ax-sep 4085 ax-pow 4138 ax-pr 4172 |
This theorem depends on definitions: df-bi 116 df-3an 965 df-tru 1338 df-nf 1441 df-sb 1743 df-eu 2009 df-mo 2010 df-clab 2144 df-cleq 2150 df-clel 2153 df-nfc 2288 df-ral 2440 df-rex 2441 df-rab 2444 df-v 2714 df-sbc 2938 df-csb 3032 df-un 3106 df-in 3108 df-ss 3115 df-pw 3546 df-sn 3567 df-pr 3568 df-op 3570 df-uni 3775 df-br 3968 df-opab 4029 df-mpt 4030 df-id 4256 df-xp 4595 df-rel 4596 df-cnv 4597 df-co 4598 df-dm 4599 df-rn 4600 df-res 4601 df-ima 4602 df-iota 5138 df-fun 5175 df-fn 5176 df-f 5177 df-fv 5181 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |