Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > qliftfuns | 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 |
---|---|
qlift.1 | ⊢ 𝐹 = ran (𝑥 ∈ 𝑋 ↦ 〈[𝑥]𝑅, 𝐴〉) |
qlift.2 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ 𝑌) |
qlift.3 | ⊢ (𝜑 → 𝑅 Er 𝑋) |
qlift.4 | ⊢ (𝜑 → 𝑋 ∈ V) |
Ref | Expression |
---|---|
qliftfuns | ⊢ (𝜑 → (Fun 𝐹 ↔ ∀𝑦∀𝑧(𝑦𝑅𝑧 → ⦋𝑦 / 𝑥⦌𝐴 = ⦋𝑧 / 𝑥⦌𝐴))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | qlift.1 | . . 3 ⊢ 𝐹 = ran (𝑥 ∈ 𝑋 ↦ 〈[𝑥]𝑅, 𝐴〉) | |
2 | nfcv 2281 | . . . . 5 ⊢ Ⅎ𝑦〈[𝑥]𝑅, 𝐴〉 | |
3 | nfcv 2281 | . . . . . 6 ⊢ Ⅎ𝑥[𝑦]𝑅 | |
4 | nfcsb1v 3035 | . . . . . 6 ⊢ Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐴 | |
5 | 3, 4 | nfop 3721 | . . . . 5 ⊢ Ⅎ𝑥〈[𝑦]𝑅, ⦋𝑦 / 𝑥⦌𝐴〉 |
6 | eceq1 6464 | . . . . . 6 ⊢ (𝑥 = 𝑦 → [𝑥]𝑅 = [𝑦]𝑅) | |
7 | csbeq1a 3012 | . . . . . 6 ⊢ (𝑥 = 𝑦 → 𝐴 = ⦋𝑦 / 𝑥⦌𝐴) | |
8 | 6, 7 | opeq12d 3713 | . . . . 5 ⊢ (𝑥 = 𝑦 → 〈[𝑥]𝑅, 𝐴〉 = 〈[𝑦]𝑅, ⦋𝑦 / 𝑥⦌𝐴〉) |
9 | 2, 5, 8 | cbvmpt 4023 | . . . 4 ⊢ (𝑥 ∈ 𝑋 ↦ 〈[𝑥]𝑅, 𝐴〉) = (𝑦 ∈ 𝑋 ↦ 〈[𝑦]𝑅, ⦋𝑦 / 𝑥⦌𝐴〉) |
10 | 9 | rneqi 4767 | . . 3 ⊢ ran (𝑥 ∈ 𝑋 ↦ 〈[𝑥]𝑅, 𝐴〉) = ran (𝑦 ∈ 𝑋 ↦ 〈[𝑦]𝑅, ⦋𝑦 / 𝑥⦌𝐴〉) |
11 | 1, 10 | eqtri 2160 | . 2 ⊢ 𝐹 = ran (𝑦 ∈ 𝑋 ↦ 〈[𝑦]𝑅, ⦋𝑦 / 𝑥⦌𝐴〉) |
12 | qlift.2 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ 𝑌) | |
13 | 12 | ralrimiva 2505 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 𝐴 ∈ 𝑌) |
14 | 4 | nfel1 2292 | . . . 4 ⊢ Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐴 ∈ 𝑌 |
15 | 7 | eleq1d 2208 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝐴 ∈ 𝑌 ↔ ⦋𝑦 / 𝑥⦌𝐴 ∈ 𝑌)) |
16 | 14, 15 | rspc 2783 | . . 3 ⊢ (𝑦 ∈ 𝑋 → (∀𝑥 ∈ 𝑋 𝐴 ∈ 𝑌 → ⦋𝑦 / 𝑥⦌𝐴 ∈ 𝑌)) |
17 | 13, 16 | mpan9 279 | . 2 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → ⦋𝑦 / 𝑥⦌𝐴 ∈ 𝑌) |
18 | qlift.3 | . 2 ⊢ (𝜑 → 𝑅 Er 𝑋) | |
19 | qlift.4 | . 2 ⊢ (𝜑 → 𝑋 ∈ V) | |
20 | csbeq1 3006 | . 2 ⊢ (𝑦 = 𝑧 → ⦋𝑦 / 𝑥⦌𝐴 = ⦋𝑧 / 𝑥⦌𝐴) | |
21 | 11, 17, 18, 19, 20 | qliftfun 6511 | 1 ⊢ (𝜑 → (Fun 𝐹 ↔ ∀𝑦∀𝑧(𝑦𝑅𝑧 → ⦋𝑦 / 𝑥⦌𝐴 = ⦋𝑧 / 𝑥⦌𝐴))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∀wal 1329 = wceq 1331 ∈ wcel 1480 ∀wral 2416 Vcvv 2686 ⦋csb 3003 〈cop 3530 class class class wbr 3929 ↦ cmpt 3989 ran crn 4540 Fun wfun 5117 Er wer 6426 [cec 6427 |
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 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-sep 4046 ax-pow 4098 ax-pr 4131 ax-un 4355 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ral 2421 df-rex 2422 df-rab 2425 df-v 2688 df-sbc 2910 df-csb 3004 df-un 3075 df-in 3077 df-ss 3084 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-br 3930 df-opab 3990 df-mpt 3991 df-id 4215 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-rn 4550 df-res 4551 df-ima 4552 df-iota 5088 df-fun 5125 df-fn 5126 df-f 5127 df-fv 5131 df-er 6429 df-ec 6431 df-qs 6435 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |